Petri nets properties related to the unboundness and analyzed using coverability multigraph

DOI10.2478/JAMSI-2014-001zbMath1334.68152OpenAlexW1999628437MaRDI QIDQ275588

Branislav Hrúz, Iveta Dirgová Luptáková, Miroslav Beňo

Publication date: 26 April 2016

Published in: Journal of Applied Mathematics, Statistics and Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/jamsi-2014-001

zbMATH Keywords

Petri nets\(\omega\)-markingcoverability multigraphcoverability setunboundness and coverability property

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)

Uses Software

• UMDES

Cites Work

• Modeling and control of discrete-event dynamic systems with Petri nets and other tools.
• Introduction to Discrete Event Systems
• Understanding Petri Nets
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Petri nets properties related to the unboundness and analyzed using coverability multigraph