Covering step graph

DOI10.1007/3-540-61363-3_28zbMath1418.68157OpenAlexW1589633291MaRDI QIDQ4633181

François Michel, Pierre Azéma, François Vernadat

Publication date: 2 May 2019

Published in: Application and Theory of Petri Nets 1996 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61363-3_28

zbMATH Keywords

concurrent systemspartial orderverification methodsstate space exploration

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

Covering Steps Graphs of Time Petri Nets

Cites Work

• Using partial orders for the efficient verification of deadlock freedom and safety properties
• Algebraic laws for nondeterminism and concurrency
• Unnamed Item
• Unnamed Item

This page was built for publication: Covering step graph