Event-Clock Visibly Pushdown Automata

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.

• Type: Conference
• Year: 2009
• Where: SOFSEM
• Authors: Nguyen Van Tang, Mizuhito Ogawa
• Keywords: Pushdown Automata, Pushdown Automaton, Simple Real-time Pushdown, SOFSEM 2009, Theoretical Computer Science