Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning

DOI10.1007/978-3-642-21834-7_5zbMath1330.68216MaRDI QIDQ3011882

Frédéric Servais, Pierre-Alain Reynier

Publication date: 29 June 2011

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

Full work available at URL: http://hdl.handle.net/1942/14846

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Unbounded-Thread Program Verification using Thread-State Equations ⋮ Synchronizing sequences on a class of unbounded systems using synchronized Petri nets

Cites Work

• Parallel program schemata
• ON THE EFFICIENT COMPUTATION OF THE MINIMAL COVERABILITY SET OF PETRI NETS
• Forward Analysis for WSTS, Part II: Complete WSTS
• Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning