Structurally Cyclic Petri Nets
2015 (English)In: Logical Methods in Computer Science, ISSN 1860-5974, E-ISSN 1860-5974, Vol. 11, no 4, 15Article in journal (Refereed) Published
A Petri net is structurally cyclic if every configuration is reachable from itself in one or more steps. We show that structural cyclicity is decidable in deterministic polynomial time. For this, we adapt the Kosaraju's approach for the general reachability problem for Petri nets.
Place, publisher, year, edition, pages
2015. Vol. 11, no 4, 15
Research subject Computer Science
IdentifiersURN: urn:nbn:se:umu:diva-108392DOI: 10.2168/LMCS-11(4:15)2015ISI: 000373922900015OAI: oai:DiVA.org:umu-108392DiVA: diva2:852759