Covering step graph

DOI10.1007/3-540-61363-3_28MaRDI QIDQ4633181zbMATH OpenOpenAlexFDO

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

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

partial orderconcurrent systemsverification 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)

Recommendations

• scientific article; zbMATH DE number 975337
• scientific article; zbMATH DE number 878334
• scientific article; zbMATH DE number 1792592
• Covering regular graphs
• Covering walks in graphs
• The covering chain of a graph
• The ascending graphoidal cover
• scientific article; zbMATH DE number 1286748
• Covering Graphs by Cycles
• Covering a graph with cycles

Cites work

• scientific article; zbMATH DE number 3885321 (Why is no real title available?)
• scientific article; zbMATH DE number 4028914 (Why is no real title available?)
• Algebraic laws for nondeterminism and concurrency
• Using partial orders for the efficient verification of deadlock freedom and safety properties

Cited in

(4)

• On the Step Explosion Problem
• Covering steps graphs of time Petri nets
• Covering step graph preserving failure semantics
• On Stubborn Sets in the Verification of Linear Time Temporal Properties

This page was built for publication: Covering step graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633181)