Stop-transitions of Petri Nets*

DOI10.3233/FI-2020-1951zbMath1497.68334OpenAlexW3089612280MaRDI QIDQ4988957

Jörg Desel, Marc Finthammer

Publication date: 20 May 2021

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2020-1951

zbMATH Keywords

unbounded Petri netscoverability graphsminimal coverability setsstop-transitionstermination of Petri nets

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decidability of model checking for infinite-state concurrent systems
• Basis coverability graph for partially observable Petri nets with application to diagnosability analysis
• On the computation of the minimal coverability set of Petri nets
• Parallel program schemata
• Constructing Minimal Coverability Sets
• On the Efficient Computation of the Minimal Coverability Set for Petri Nets
• Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning
• Old and New Algorithms for Minimal Coverability Sets
• Mathematical Foundations of Computer Science 2005
• Introduction to Petri Nets

This page was built for publication: Stop-transitions of Petri Nets*