When are timed automata weakly timed bisimilar to time Petri nets?

DOI10.1016/j.tcs.2008.03.030zbMath1158.68029OpenAlexW1989800577MaRDI QIDQ944375

Olivier H. Roux, Franck Cassez, Serge Haddad, Béatrice Bérard, Didier Lime

Publication date: 16 September 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.03.030

zbMATH Keywords

timed automatatime Petri netsweak timed bisimilarity

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Waiting Nets: State Classes and Taxonomy, A concurrency-preserving translation from time Petri nets to networks of timed automata, Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets

Uses Software

• Romeo
• Kronos
• Uppaal2k
• TINA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theory of timed automata
• Symbolic model checking for real-time systems
• A causal semantic for time Petri nets
• Kronos: A verification tool for real-time systems
• Is your model checker on time? On the complexity of model checking for timed modal logics
• Forward analysis of updatable timed automata
• Updatable timed automata
• Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Automated Technology for Verification and Analysis
• Computer Aided Verification
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Formal Modeling and Analysis of Timed Systems