ON THE EFFICIENT COMPUTATION OF THE MINIMAL COVERABILITY SET OF PETRI NETS

DOI10.1142/S0129054110007180zbMath1198.68177OpenAlexW2156825078MaRDI QIDQ3552518

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

Publication date: 22 April 2010

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054110007180

zbMATH Keywords

Petri netscoverability set

Mathematics Subject Classification ID

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

Related Items (3)

Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning ⋮ Commodification of accelerations for the Karp and Miller construction ⋮ Synchronizing sequences on a class of unbounded systems using synchronized Petri nets

Cites Work

• Unnamed Item

This page was built for publication: ON THE EFFICIENT COMPUTATION OF THE MINIMAL COVERABILITY SET OF PETRI NETS