Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets

DOI10.1007/978-3-540-85778-5_3zbMath1171.68579OpenAlexW1659060819MaRDI QIDQ3543285

Jiří Srba

Publication date: 2 December 2008

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-85778-5_3

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 (5)

Performance Evaluation of an Emergency Call Center: Tropical Polynomial Systems Applied to Timed Petri Nets ⋮ Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets ⋮ TCTL-preserving translations from timed-arc Petri nets to networks of timed automata ⋮ Verification of Timed-Arc Petri Nets ⋮ Parametric multisingular hybrid Petri nets: formal definitions and analysis techniques

Uses Software

• Romeo
• TINA
• IF-2.0
• Uppaal
• CMC
• UPPAAL TIGA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal paths in weighted timed automata
• Undecidability of bisimilarity for Petri nets and some related problems
• Model checking of time Petri nets using the state class timed automaton
• When are timed automata weakly timed bisimilar to time Petri nets?
• Complexity of some problems in Petri nets
• Time-based expressivity of time Petri nets for system specification
• A theory of timed automata
• Time-abstracted bisimulation: Implicit specifications and decidability
• Uppaal in a nutshell
• Is your model checker on time? On the complexity of model checking for timed modal logics
• Timed Petri nets and timed automata: On the discriminating power of Zeno sequences
• Advances in verification of time Petri nets and timed automata. A temporal logic approach.
• Bridging the Gap Between Timed Automata and Bounded Time Petri Nets
• Comparison of the Expressiveness of Arc, Place and Transition Time Petri Nets
• TCTL Model Checking of Time Petri Nets
• Recoverability of Communication Protocols--Implications of a Theoretical Study
• Compositional specification of timed systems
• On the synthesis of discrete controllers for timed systems
• The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
• Hybrid Systems: Computation and Control
• Model Checking Software
• Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Automated Technology for Verification and Analysis
• Formal Methods for the Design of Real-Time Systems
• Formal Methods for the Design of Real-Time Systems
• Formal Approaches to Software Testing
• Lectures on Concurrency and Petri Nets
• Applications and Theory of Petri Nets 2005
• From Time Petri Nets to Timed Automata: An Untimed Approach
• CONCUR 2005 – Concurrency Theory
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Formal Modeling and Analysis of Timed Systems
• Well-structured transition systems everywhere!

This page was built for publication: Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets