The Reachability Problem for Vector Addition System with One Zero-Test

  • Rémi Bonnet
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6907)

Abstract

We consider here a variation of Vector Addition Systems where one counter can be tested for zero, extending the reachability proof by Leroux for Vector Addition System to our model. This provides an alternate, and hopefully simpler to understand, proof of the reachability problem that was originally proved by Reinhardt.

Keywords

Production Relation Transition Sequence Label Transition System Reachability Problem Minsky Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abdulla, P., Mayr, R.: Minimal cost reachability/coverability in priced timed petri nets. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 348–363. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  2. 2.
    Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: LICS 1996, pp. 313–321 (1996)Google Scholar
  3. 3.
    Bonnet, R.: The reachability problem for vector addition systems with one zero-test. Research Report LSV-11-11, Laboratoire Spécification et Vérification, ENS Cachan, France, pages 19 (May 2011)Google Scholar
  4. 4.
    Bonnet, R., Finkel, A., Leroux, J., Zeitoun, M.: Place-boundedness for vector addition systems with one zero-test. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2010, Leibniz International Proceedings in Informatics, Chennai, India, vol. 8, pp. 192–203. Leibniz-Zentrum für Informatik (December 2010)Google Scholar
  5. 5.
    Finkel, A., Sangnier, A.: Mixing coverability and reachability to analyze VASS with one zero-test. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorný, J., Rumpe, B. (eds.) SOFSEM 2010. LNCS, vol. 5901, pp. 394–406. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  6. 6.
    Ganty, P., Atig, M.F.: Approximating petri net reachability along context-free traces. CoRR, abs/1105.1657 (2011)Google Scholar
  7. 7.
    Kosaraju, S.R.: Decidability of reachability in vector addition systems (preliminary version). In: STOC 1982, pp. 267–281. ACM, New York (1982)CrossRefGoogle Scholar
  8. 8.
    Lambert, J.L.: A structure to decide reachability in petri nets. Theoretical Computer Science 99(1), 79 (1992)MathSciNetMATHCrossRefGoogle Scholar
  9. 9.
    Leroux, J.: The general vector addition system reachability problem by presburger inductive invariants. In: Symposium on Logic in Computer Science, pp. 4–13 (2009)Google Scholar
  10. 10.
    Leroux, J.: Vector addition system reachability problem: a short self-contained proof. SIGPLAN Not. 46, 307–316 (2011)CrossRefGoogle Scholar
  11. 11.
    Mayr, E.W.: An algorithm for the general Petri net reachability problem. In: STOC 1981: Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing, pp. 238–246. ACM, New York (1981)CrossRefGoogle Scholar
  12. 12.
    Reinhardt, K.: Reachability in Petri Nets with inhibitor arcs (1995), http://www-ti.informatik.uni-tuebingen.de/~reinhard/abstracts.html (unpublished)
  13. 13.
    Reinhardt, K.: Reachability in Petri Nets with inhibitor arcs. Electr. Notes Theor. Comput. Sci. 223, 239–264 (2008)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2011

Authors and Affiliations

  • Rémi Bonnet
    • 1
  1. 1.LSV, ENS Cachan, CNRSFrance

Personalised recommendations