Abstract
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability problem of Petri nets. In particular, we rely on Lambert’s construction of marked graph transition sequences — special instances of coverability graphs that allow us to extract constructively the simple regular expression corresponding to the downward-closure. We also consider the remaining language types for Petri nets common in the literature. For all of them, we provide algorithms that compute the simple regular expressions of their downward-closure. As application, we outline an algorithm to automatically analyse the stability of a system against attacks from a malicious environment.
The first authors were supported by the French ANR projects Averiss and Veridyc.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abdulla, P.A., Collomb-Annichini, A., Bouajjani, A., Jonsson, B.: Using forward reachability analysis for verification of lossy channel systems. Form. Methods Syst. Des. 25(1), 39–65 (2004)
Courcelle, B.: On constructing obstruction sets of words. Bulletin of the EATCS 44, 178–186 (1991)
Hack, M.: Decidability questions for Petri nets. Technical report, Cambridge, MA, USA (1976)
Higman, G.: Ordering by divisibility in abstract algebras. Proc. London Math. Soc. 2(3), 326–336 (1952)
Karp, R.M., Miller, R.E.: Parallel program schemata. J. Comput. Syst. Sci. 3(2), 147–195 (1969)
Kosaraju, S.R.: Decidability of reachability in vector addition systems (preliminary version). In: STOC, pp. 267–281. ACM, New York (1982)
Lambert, J.L.: Finding a partial solution to a linear system of equations in positive integers. Comput. Math. Applic. 15(3), 209–212 (1988)
Lambert, J.L.: A structure to decide reachability in Petri nets. Theor. Comp. Sci. 99(1), 79–104 (1992)
Mayr, E.W.: An algorithm for the general Petri net reachability problem. In: STOC, pp. 238–246. ACM, New York (1981)
Mayr, E.W.: An algorithm for the general Petri net reachability problem. SIAM J. Comp. 13(3), 441–460 (1984)
Mayr, R.: Undecidable problems in unreliable computations. Theor. Comp. Sci. 297(1-3), 337–354 (2003)
Peterson, J.L.: Petri nets. ACM Computing Surveys 9(3), 223–252 (1977)
Priese, L., Wimmel, H.: Petri-Netze. Springer, Heidelberg (2003)
Wimmel, H.: Infinity of intermediate states is decidable for Petri nets. In: Cortadella, J., Reisig, W. (eds.) ICATPN 2004. LNCS, vol. 3099, pp. 426–434. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Habermehl, P., Meyer, R., Wimmel, H. (2010). The Downward-Closure of Petri Net Languages. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds) Automata, Languages and Programming. ICALP 2010. Lecture Notes in Computer Science, vol 6199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14162-1_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-14162-1_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14161-4
Online ISBN: 978-3-642-14162-1
eBook Packages: Computer ScienceComputer Science (R0)