Abstract
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as conflict-free, BPP, normal Petri nets and more. A new decomposition approach is applied to developing an integer linear programming formulation for characterizing the reachability sets of such Petri nets. Consequently, the reachability problem is shown to be NP-complete. The model checking problem for some temporal logics is also investigated for simple-circuit Petri nets.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Esparza, J. Petri nets, commutative context-free grammars and basic parallel processes, Fundamenta Informaticae 30, 24–41, 1997.
Esparza, J. Decidability of model checking for infinite-state concurrent systems, Acta Inform. 34, 85–107, 1997.
Fribourg, L. Petri nets, flat languages and linear arithmetic. 9th Int. Workshop. on Functional and Logic Programming, pp. 344–365, 2000.
Fribourg, L. and Olsén, H. Proving safety properties of infinite state systems by compilation into Presburger arithmetic, LNCS 1243, 213–227, 1997.
Fribourg, L. and Olsén, H. A decompositional approach for computing least fixed-points of datalog programs with z-counters, Constraints, An International Journal 2, 305–335, 1997.
Howell, R. and Rosier, L. On questions of fairness and temporal logic for conflict-free Petri nets, In G. Rozenberg, editor, Advances in Petri Nets, LNCS 340, 200–226, Springer-Verlag, Berlin, 1988.
Howell, R., Rosier, L. and Yen, H. Normal and sinkless Petri nets, J. of Computer and System Sciences 46, 1–26, 1993.
Ichikawa, A. and Hiraishi, K. Analysis and control of discrete event systems represented by Petri nets, LNCIS 103, 115–134, 1987.
Kosaraju, R. Decidability of reachability in vector addition systems, Proc. the 14th Annual ACM Symposium on Theory of Computing, 267–280, 1982.
Lipton, R. The reachability problem requires exponential space, Technical Report 62, Yale University, Dept. of CS., Jan. 1976.
Mayr, E. An algorithm for the general Petri net reachability problem, SIAM J. Comput. 13, 441–460, 1984.
Mayr, R. Weak bisimulation and model checking for basic parallel processes, Proc. FSTTCS’96, LNCS 1180, 88–99, 1996.
Murata, T. Petri nets: properties, analysis and applications, Proc. Of the IEEE 77(4), 541–580, 1989.
Olsén, H. Automatic verification of Petri nets in a CLP framework, Ph.D. Thesis, Dept. of Computer and Information Science, IDA, Linköping Univ., 1997.
Yamasaki, H. Normal Petri nets, Theoretical Comput. Science 31, 307–315, 1984.
Yen, H. A unified approach for deciding the existence of certain Petri net paths, Inform. and Comput., 96(1), 119–137, 1992.
Yen, H. On the regularity of Petri net languages, Inform. and Comput., 124(2), 168–181, 1996.
Yen, H. On reachability equivalence for BPP-nets, Theoretical Computer Science, 179, 301–317, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yen, HC., Yu, LP. (2003). Petri Nets with Simple Circuits. In: Warnow, T., Zhu, B. (eds) Computing and Combinatorics. COCOON 2003. Lecture Notes in Computer Science, vol 2697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45071-8_17
Download citation
DOI: https://doi.org/10.1007/3-540-45071-8_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40534-4
Online ISBN: 978-3-540-45071-9
eBook Packages: Springer Book Archive