Abstract
We introduce the class of event-clock visibly pushdown automata (ECVPAs) as an extension of event-clock automata. The class of ECVPAs, on one hand, can model simple real-time pushdown systems and, on the other hand, is determinizable and closed under Boolean operations. We also show that for a timed visibly pushdown automaton A and an ECVPA B, the inclusion problem L(A) ? L(B) is decidable. © Springer-Verlag Berlin Heidelberg 2009.
Cite
CITATION STYLE
Van Tang, N., & Ogawa, M. (2009). Event-clock visibly pushdown automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5404 LNCS, pp. 558–569). https://doi.org/10.1007/978-3-540-95891-8_50
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
