A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application
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.
Unable to display preview. Download preview PDF.
- 1.Cardoza, E., Lipton, R., Meyer, A.R.: Exponential space complete problems for Petri nets and commutative semigroups (preliminary report). In: Proceedings of the 8th ACM Symposium on Theory of Computing (STOC 1976), pp. 50–54. ACM (1976)Google Scholar
- 4.Hack, M.: The recursive equivalence of the reachability problem and the liveness problem for Petri nets and vector addition systems. In: IEEE Conference Record of the 15th Annual Symposium on Switching and Automata Theory, pp. 156–164 (1974)Google Scholar
- 18.Watanabe, T., Mizobata, Y., Onaga, K.: Legal firing sequence and related problems of Petri nets. In: Proceedings of the 3rd International Workshop on Petri Nets and Performance Models (PNPM 1989), pp. 277–286 (1989)Google Scholar