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.

Saved in:
Bibliographic Details
Published in:Logical methods in computer science 2015-01, Vol.11, Issue 4 (4)
Main Authors: Frank, Drewes, Jérôme, Leroux
Format: Article
Language:English
Subjects:
Computer Science
computer science - logic in computer science
datalogi
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
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
1860-5974
DOI:10.2168/LMCS-11(4:15)2015