A framework for classical Petri net problems: Conservative Petri nets as an application

Ernst W. Mayr, Jeremias Weihmann

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

We present a framework based on permutations of firing sequences and on canonical firing sequences to approach computational problems involving classes of Petri nets with arbitrary arc multiplicities. As an example of application, we use these techniques to obtain PSPACE-completeness for the reachability and the covering problems of conservative Petri nets, generalizing known results for ordinary 1-conservative Petri nets. We also prove PSPACE-completeness for the RecLFS and the liveness problems of conservative Petri nets, for which, in case of ordinary 1-conservative Petri nets, PSPACE-membership but no matching lower bound has been known. Last, we show PSPACE-completeness for the containment and equivalence problems of conservative Petri nets. PSPACE-hardness of the problems mentioned above still holds if they are restricted to ordinary 1-conservative Petri nets.

Original languageEnglish
Title of host publicationApplication and Theory of Petri Nets and Concurrency - 35th International Conference, PETRI NETS 2014, Proceedings
PublisherSpringer Verlag
Pages314-333
Number of pages20
ISBN (Print)9783319077338
DOIs
StatePublished - 2014
Event35th International Conference on Application and Theory of Petri Nets and Concurrency, PETRI NETS 2014 - Tunis, Tunisia
Duration: 23 Jun 201427 Jun 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8489 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference35th International Conference on Application and Theory of Petri Nets and Concurrency, PETRI NETS 2014
Country/TerritoryTunisia
CityTunis
Period23/06/1427/06/14

Fingerprint

Dive into the research topics of 'A framework for classical Petri net problems: Conservative Petri nets as an application'. Together they form a unique fingerprint.

Cite this