Covering Steps Graphs of Time Petri Nets

DOI10.1016/j.entcs.2009.05.037zbMath1347.68254OpenAlexW2027595901MaRDI QIDQ5179058

Kamel Barkaoui, Hanifa Boucheneb

Publication date: 19 March 2015

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.05.037

zbMATH Keywords

timed Petri netscovering steps graphstate class graph method

Mathematics Subject Classification ID

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

Related Items (1)

Partial order reduction for checking soundness of time workflow nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stutter-invariant temporal properties are expressible without the next-time operator
• Partial-order reduction techniques for real-time model checking
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• CTL* model checking for time Petri nets
• Covering step graph
• The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
• Applications and Theory of Petri Nets 2004
• Formal Modeling and Analysis of Timed Systems
• On Interleaving in Timed Automata

This page was built for publication: Covering Steps Graphs of Time Petri Nets