Change search
ReferencesLink to record
Permanent link

Direct link
Structurally Cyclic Petri Nets
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Natural and Formal Languages)ORCID iD: 0000-0001-7349-7693
LaBRI, CNRS, Université de Bordeaux.
2015 (English)In: Logical Methods in Computer Science, ISSN 1860-5974, E-ISSN 1860-5974, Vol. 11, no 4, 15Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
2015. Vol. 11, no 4, 15
National Category
Computer Science
Research subject
Computer Science
URN: urn:nbn:se:umu:diva-108392DOI: 10.2168/LMCS-11(4:15)2015ISI: 000373922900015OAI: diva2:852759
Available from: 2015-09-10 Created: 2015-09-10 Last updated: 2016-05-11Bibliographically approved

Open Access in DiVA

fulltext(199 kB)11 downloads
File information
File name FULLTEXT01.pdfFile size 199 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Drewes, Frank
By organisation
Department of Computing Science
In the same journal
Logical Methods in Computer Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 11 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 76 hits
ReferencesLink to record
Permanent link

Direct link