Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions

DOI10.1007/978-3-642-00982-2_62MaRDI QIDQ3618627zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Timed Automata with Integer Resets: Language Inclusion and Expressiveness
• Adding dense-timed stack to integer reset timed automata
• scientific article; zbMATH DE number 1337733
• A theory of timed automata
• Removing -transitions in timed automata

Cites work

• A theory of timed automata
• Alternating timed automata
• CONCUR 2004 - Concurrency Theory
• Event-clock automata: a determinizable class of timed automata
• scientific article; zbMATH DE number 1337733 (Why is no real title available?)
• scientific article; zbMATH DE number 1530301 (Why is no real title available?)
• Timed Automata with Integer Resets: Language Inclusion and Expressiveness
• Undecidability Results for Timed Automata with Silent Transitions
• Undecidable Problems About Timed Automata

Cited in

(6)

• Timed Automata with Integer Resets: Language Inclusion and Expressiveness
• A survey of timed automata for the development of real-time systems
• scientific article; zbMATH DE number 1337733 (Why is no real title available?)
• On the power of non-observable actions in timed automata
• Model checking weighted integer reset timed automata
• New insights into opacity verification in timed discrete-event systems

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

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