Advertisement

The Downward-Closure of Petri Net Languages

  • Peter Habermehl
  • Roland Meyer
  • Harro Wimmel
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6199)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)zbMATHCrossRefGoogle Scholar
  2. 2.
    Courcelle, B.: On constructing obstruction sets of words. Bulletin of the EATCS 44, 178–186 (1991)zbMATHGoogle Scholar
  3. 3.
    Hack, M.: Decidability questions for Petri nets. Technical report, Cambridge, MA, USA (1976)Google Scholar
  4. 4.
    Higman, G.: Ordering by divisibility in abstract algebras. Proc. London Math. Soc. 2(3), 326–336 (1952)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Karp, R.M., Miller, R.E.: Parallel program schemata. J. Comput. Syst. Sci. 3(2), 147–195 (1969)zbMATHMathSciNetGoogle Scholar
  6. 6.
    Kosaraju, S.R.: Decidability of reachability in vector addition systems (preliminary version). In: STOC, pp. 267–281. ACM, New York (1982)Google Scholar
  7. 7.
    Lambert, J.L.: Finding a partial solution to a linear system of equations in positive integers. Comput. Math. Applic. 15(3), 209–212 (1988)zbMATHCrossRefGoogle Scholar
  8. 8.
    Lambert, J.L.: A structure to decide reachability in Petri nets. Theor. Comp. Sci. 99(1), 79–104 (1992)zbMATHCrossRefGoogle Scholar
  9. 9.
    Mayr, E.W.: An algorithm for the general Petri net reachability problem. In: STOC, pp. 238–246. ACM, New York (1981)Google Scholar
  10. 10.
    Mayr, E.W.: An algorithm for the general Petri net reachability problem. SIAM J. Comp. 13(3), 441–460 (1984)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Mayr, R.: Undecidable problems in unreliable computations. Theor. Comp. Sci. 297(1-3), 337–354 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Peterson, J.L.: Petri nets. ACM Computing Surveys 9(3), 223–252 (1977)zbMATHCrossRefGoogle Scholar
  13. 13.
    Priese, L., Wimmel, H.: Petri-Netze. Springer, Heidelberg (2003)zbMATHGoogle Scholar
  14. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Peter Habermehl
    • 1
  • Roland Meyer
    • 1
  • Harro Wimmel
    • 2
  1. 1.LIAFA, Paris Diderot University & CNRS 
  2. 2.Department of Computing ScienceUniversity of Rostock 

Personalised recommendations