Frank, Drewes and Jérôme, Leroux - Structurally Cyclic Petri Nets

lmcs:1616 - Logical Methods in Computer Science, December 22, 2015, Volume 11, Issue 4
Structurally Cyclic Petri Nets

Authors: Frank, Drewes and Jérôme, Leroux

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.


Source : oai:arXiv.org:1510.08331
DOI : 10.2168/LMCS-11(4:15)2015
Volume: Volume 11, Issue 4
Published on: December 22, 2015
Submitted on: February 23, 2015
Keywords: Computer Science - Logic in Computer Science


Share

Consultation statistics

This page has been seen 91 times.
This article's PDF has been downloaded 38 times.