The Downward-Closure of Petri Net Languages
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.
Unable to display preview. Download preview PDF.
- 3.Hack, M.: Decidability questions for Petri nets. Technical report, Cambridge, MA, USA (1976)Google Scholar
- 6.Kosaraju, S.R.: Decidability of reachability in vector addition systems (preliminary version). In: STOC, pp. 267–281. ACM, New York (1982)Google Scholar
- 9.Mayr, E.W.: An algorithm for the general Petri net reachability problem. In: STOC, pp. 238–246. ACM, New York (1981)Google Scholar
- 14.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)Google Scholar