On the Efficient Computation of the Minimal Coverability Set for Petri Nets

DOI10.1007/978-3-540-75596-8_9zbMath1141.68507OpenAlexW1744908390MaRDI QIDQ3510790

Gilles Geeraerts, Laurent Van Begin, Jean-François Raskin

Publication date: 3 July 2008

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75596-8_9

Mathematics Subject Classification ID

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

Related Items (3)

On the Efficient Computation of the Minimal Coverability Set for Petri Nets ⋮ Unbounded-Thread Program Verification using Thread-State Equations ⋮ Stop-transitions of Petri Nets*

Cites Work

• Unnamed Item
• Parallel program schemata
• Well-structured languages
• On the Efficient Computation of the Minimal Coverability Set for Petri Nets
• Reasoning about systems with many processes

This page was built for publication: On the Efficient Computation of the Minimal Coverability Set for Petri Nets