Verification of Timed-Arc Petri Nets

DOI10.1007/978-3-642-18381-2_4zbMath1298.68175OpenAlexW1823152540MaRDI QIDQ3075507

Mikael H. Møller, Morten Jacobsen, Lasse Jacobsen, Jiří Srba

Publication date: 15 February 2011

Published in: SOFSEM 2011: Theory and Practice of Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

A counter abstraction technique for verifying properties of probabilistic swarm systems, Waiting nets, Performance Evaluation of an Emergency Call Center: Tropical Polynomial Systems Applied to Timed Petri Nets, TCTL-preserving translations from timed-arc Petri nets to networks of timed automata, WQO dichotomy for 3-graphs, Combining free choice and time in Petri nets, Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture, Decidable Classes of Unbounded Petri Nets with Time and Urgency, Strong behavioral similarities in timed-arc Petri nets

Uses Software

• Romeo
• TAPAAL
• Kronos
• TINA
• IF-2.0
• PetriNets
• Uppaal
• CMC

Cites Work

• A theory of timed automata
• 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.
• Undecidability of Coverability and Boundedness for Timed-Arc Petri Nets with Invariants
• Bridging the Gap Between Timed Automata and Bounded Time Petri Nets
• Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
• TCTL Model Checking of Time Petri Nets
• Recoverability of Communication Protocols--Implications of a Theoretical Study
• Compositional specification of timed systems
• The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
• Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Formal Methods for the Design of Real-Time Systems
• Formal Methods for the Design of Real-Time Systems
• Applications and Theory of Petri Nets 2005
• Computer Aided Verification
• Well-structured transition systems everywhere!
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item