Some applications of the minimal coverability structures

zbMATH Open1134.68452MaRDI QIDQ5457672FDOQ5457672

Authors: Cristian Vidraşcu 

Publication date: 14 April 2008

Recommendations

• On converbility structures for jumping Petri nets
• On the Efficient Computation of the Minimal Coverability Set for Petri Nets
• Old and new algorithms for minimal coverability sets
• Old and new algorithms for minimal coverability sets
• On the efficient computation of the minimal coverability set of Petri nets

zbMATH Keywords

Petri netscompatibilityparallel/distributed systemsjumping Petri netsminimal coverability graphconcurrency-degrees

Mathematics Subject Classification ID

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

Cited In (4)

• Constructing Minimal Coverability Sets
• Logical Approaches to Computational Barriers
• Concurrency-degrees for jumping Petri nets
• On converbility structures for jumping Petri nets

This page was built for publication: Some applications of the minimal coverability structures

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