Structurally Cyclic Petri Nets
Logic in Computer Science
2017-01-11 v2
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.
Keywords
Cite
@article{arxiv.1510.08331,
title = {Structurally Cyclic Petri Nets},
author = {Drewes Frank and Leroux Jérôme},
journal= {arXiv preprint arXiv:1510.08331},
year = {2017}
}
Comments
9 pages. Key words: Petri net, vector addition system, structural cyclicity, reachability