Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions

DOI10.1007/978-3-642-00982-2_62zbMath1234.68242OpenAlexW1926126172MaRDI QIDQ3618627

P. Vijay Suman, Paritosh K. Pandya

Publication date: 2 April 2009

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_62

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

A survey of timed automata for the development of real-time systems ⋮ Model checking weighted integer reset timed automata

Cites Work

• Unnamed Item
• Unnamed Item
• Event-clock automata: a determinizable class of timed automata
• A theory of timed automata
• Undecidable Problems About Timed Automata
• Timed Automata with Integer Resets: Language Inclusion and Expressiveness
• Undecidability Results for Timed Automata with Silent Transitions
• Alternating timed automata
• CONCUR 2004 - Concurrency Theory

This page was built for publication: Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions