Structurally Cyclic Petri Nets
Drewes Frank (Dept. of Computing Science, Ume{\aa} University,, Ume{\aa}, Sweden), Leroux J\'er\^ome (LaBRI, CNRS)
TL;DR
This paper introduces a polynomial-time decision procedure for determining whether a Petri net is structurally cyclic, meaning every configuration can reach itself through some sequence of transitions.
Contribution
It adapts Kosaraju's approach to establish that structural cyclicity in Petri nets is decidable within deterministic polynomial time.
Findings
Structural cyclicity is decidable in polynomial time.
The method adapts Kosaraju's approach for reachability.
The result improves understanding of Petri net properties.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.