Event-Clock Visibly Pushdown Automata

DOI10.1007/978-3-540-95891-8_50zbMath1206.68183OpenAlexW1508670740MaRDI QIDQ3599103

Mizuhito Ogawa, Nguyen Van Tang

Publication date: 3 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-95891-8_50

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

Event Clock Automata: From Theory to Practice ⋮ A survey of timed automata for the development of real-time systems ⋮ Unnamed Item ⋮ Reachability relations of timed pushdown automata ⋮ On regions and zones for event-clock automata ⋮ A Perfect Class of Context-Sensitive Timed Languages ⋮ On the determinization of event-clock input-driven pushdown automata ⋮ Context-free timed formalisms: robust automata and linear temporal logics

Cites Work

• Event-clock automata: a determinizable class of timed automata
• A theory of timed automata
• Model Checking One-clock Priced Timed Automata
• Visibly pushdown languages
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• A Logical Characterisation of Event Clock Automata
• Automata, Languages and Programming
• Hybrid Systems: Computation and Control
• Well-structured transition systems everywhere!

This page was built for publication: Event-Clock Visibly Pushdown Automata