Abstract
Semilinear sets play a key role in many areas of computer science, in particular, in theoretical computer science, as they are characterizable by Presburger Arithmetic (a decidable theory). The reachability set of a Petri net is not semilinear in general. There are, however, a wide variety of subclasses of Petri nets enjoying semilinear reachability sets, and such results as well as analytical techniques developed around them contribute to important milestones historically in the analysis of Petri nets. In this talk, we first give a brief survey on results related to Petri nets with semilinear reachability sets. We then focus on a technique capable of unifying many existing semilinear Petri nets in a coherent way. The unified strategy also leads to various new semilinearity results for Petri nets. Finally, we shall also briefly touch upon the notion of almost semilinear sets which witnesses some recent advances towards the general Petri net reachability problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Araki, T., Kasami, T.: Decidability problems on the strong connectivity of Petri net reachability sets. Theor. Comput. Sci. 4, 99–119 (1977)
Esparza, J.: Petri nets, commutative grammars and basic parallel processes. Fundamenta Informaticae 30, 24–41 (1997)
Hauschildt, D.: Semilinearity of the Reachability Set is Decidable for Petri Nets. Technical report FBI-HH-B-146/90, University of Hamburg (1990)
Hopcroft, J., Pansiot, J.: On the reachability problem for 5-dimensional vector addition systems. Theor. Comput. Sci. 8, 135–159 (1979)
Huynh, D.: Commutative grammars: the complexity of uniform word problems. Inf. Control 57, 21–39 (1983)
Kosaraju, R.: Decidability of reachability in vector addition systems. In: 14th ACM Symposium on Theory of Computing, pp. 267–280 (1982)
Landweber, L., Robertson, E.: Properties of conflict-free and persistent Petri nets. JACM 25, 352–364 (1978)
Leroux, J.: The general vector addition system reachability problem by presburger inductive invariants. In: LICS 2009, pp. 4–13. IEEE Computer Society (2009)
Leroux, J.: Presburger vector addition systems. In: LICS 2013, pp. 23–32. IEEE Computer Society (2013)
Leroux, J., Sutre, G.: Flat counter automata almost everywhere!. In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol. 3707, pp. 489–503. Springer, Heidelberg (2005). doi:10.1007/11562948_36
Leroux, J., Schmitz, S.: Demystifying reachability in vector addition systems. In: LICS 2015, pp. 56–67. IEEE Computer Society (2015)
Lipton, R.: The Reachability Problem Requires Exponential Space. Technical report 62, Yale University, Dept. of CS, January 1976
Mayr, E.: An algorithm for the general Petri net reachability problem. In: 13th ACM Symposium on Theory of Computing, pp. 238–246 (1981)
Yamasaki, H.: On weak persistency of Petri nets. Inf. Process. Lett. 13, 94–97 (1981)
Yamasaki, H.: Normal Petri nets. Theor. Comput. Sci. 31, 307–315 (1984)
Yen, H.: Introduction to Petri net theory. In: Esik, Z., Martin-Vide, C., Mitrana, V. (eds.) Recent Advances in Formal Languages and Applications. Studies in Computational Intelligence, vol. 25, pp. 343–373. Springer, Heidelberg (2006)
Yen, H.: Path decomposition and semilinearity of Petri nets. Int. J. Found. Comput. Sci. 20(4), 581–596 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Yen, HC. (2016). Petri Nets and Semilinear Sets (Extended Abstract). In: Sampaio, A., Wang, F. (eds) Theoretical Aspects of Computing – ICTAC 2016. ICTAC 2016. Lecture Notes in Computer Science(), vol 9965. Springer, Cham. https://doi.org/10.1007/978-3-319-46750-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-46750-4_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-46749-8
Online ISBN: 978-3-319-46750-4
eBook Packages: Computer ScienceComputer Science (R0)