Event-Clock Visibly Pushdown Automata

DOI10.1007/978-3-540-95891-8_50MaRDI QIDQ3599103zbMATH OpenOpenAlexFDO

Authors Nguyen Van Tang, Mizuhito Ogawa

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)

Recommendations

• Event-clock automata: a determinizable class of timed automata
• Event-clock nested automata
• On the determinization of event-clock input-driven pushdown automata
• Event clock automata: from theory to practice
• A Logical Characterisation of Event Clock Automata
• scientific article; zbMATH DE number 1390065
• Visibly pushdown automata and transducers with counters
• Timed Pushdown Automata Revisited
• scientific article; zbMATH DE number 1949647

Cites work

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

Cited in

(14)

• Event-clock automata: a determinizable class of timed automata
• Event-clock nested automata
• On the determinization of event-clock input-driven pushdown automata
• Context-free timed formalisms: robust automata and linear temporal logics
• Reachability relations of timed pushdown automata
• A logical characterization for dense-time visibly pushdown automata
• A perfect class of context-sensitive timed languages
• Event clock automata: from theory to practice
• Timed context-free temporal logics
• A survey of timed automata for the development of real-time systems
• On regions and zones for event-clock automata
• scientific article; zbMATH DE number 1390065 (Why is no real title available?)
• Exact descriptional complexity of determinization of input-driven pushdown automata
• Probabilistic input-driven pushdown automata

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599103)