Completeness Results for Generalized Communication-Free Petri Nets with Arbitrary Edge Multiplicities
We investigate gcf-Petri nets, a generalization of communication-free Petri nets allowing arbitrary edge multiplicities, and characterized by the sole restriction that each transition has at most one incoming edge. We use canonical firing sequences with nice properties for gcf-PNs to show that the RecLFS, (zero-)reachability, covering, and boundedness problems of gcf-PNs are in PSPACE. By showing, how PSPACE-Turing machines can be simulated by gss-PNs, a subclass of gcf-PNs where additionally all transitions have at most one outgoing edge, we ultimately prove the PSPACE-completess of these problems for gss/gcf-PNs. Last, we show PSPACE-hardness as well as a doubly exponential space bound for the containment and equivalence problems of gss/gcf-PNs.
Unable to display preview. Download preview PDF.
- 5.Ha, L.M., Trung, P.V., Duong, P.T.H.: A polynomial-time algorithm for reachability problem of a subclass of Petri net and chip firing games. In: 2012 IEEE RIVF International Conference on Computing and Communication Technologies, Research, Innovation, and Vision for the Future (RIVF), pp. 1–6 (2012)Google Scholar
- 11.Huynh, D.T.: A simple proof for the sum upper bound of the inequivalence problem for semilinear sets. Elektronische Informationsverarbeitung und Kybernetik, 147–156 (1986)Google Scholar
- 14.Mayr, E.W., Weihmann, J.: Completeness Results for Generalized Communication-free Petri Nets with Arbitrary Edge Multiplicities. Technical Report TUM-I1335, Institut für Informatik, TU München (Jul 2013)Google Scholar