Structurally Cyclic Petri Nets
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.
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Logical Methods in Computer Science e.V.
2015-12-01
|
| Series: | Logical Methods in Computer Science |
| Subjects: | |
| Online Access: | https://lmcs.episciences.org/1616/pdf |
| Summary: | 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. |
|---|---|
| ISSN: | 1860-5974 |