Skip to main content

Model Checking Lossy Vector Addition Systems

  • Conference paper
  • First Online:
STACS 99 (STACS 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1563))

Included in the following conference series:

Abstract

Lossy VASS (vector addition systems with states) are defined as a subclass of VASS in analogy to lossy FIFO-channel systems. They can be used to model concurrent systems with unreliable communication. We analyze the decidability of model checking problems for lossy systems and several branching-time and linear-time temporal logics. We present an almost complete picture of the decidability of model checking for normal VASS, lossy VASS and lossy VASS with test for zero.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. P. Abdulla, K. Cerans, B. Jonsson, and Y-K. Tsay. General Decidability Theorems for Infinite-state Systems. In LICS’96. IEEE, 1996.

    Google Scholar 

  2. P. Abdulla and B. Jonsson. Verifying Programs with Unreliable Channels. In LICS’93. IEEE, 1993.

    Google Scholar 

  3. P. Abdulla and B. Jonsson. Undecidable verification problems for programs with unreliable channels. Information and Computation, 130(1):71–90, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  4. Gérard Cécé, Alain Finkel, and S. Purushothaman Iyer. Unreliable Channels Are Easier to Verify Than Perfect Channels. Information and Computation, 124(1):20–31, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  5. C. Dufourd, A. Finkel, and Ph. Schnoebelen. Reset nets between decidability and undecidability. In Proc. of ICALP’98, volume 1443 of LNCS, Springer Verlag, 1998.

    Google Scholar 

  6. J. Esparza and A. Kiehn. On the model checking problem for branching time logics and Basic Parallel Processes. In CAV’95, volume 939 of LNCS, pages 353–366. Springer Verlag, 1995.

    Google Scholar 

  7. J. Esparza. Decidability of model checking for infinite-state concurrent systems. Acta Informatica, 34:85–107, 1997.

    Article  MathSciNet  Google Scholar 

  8. O. Grumberg and D. Long. Model Checking and Modular Verification. ACM Transactions on Programming Languages and Systems, 16, 1994.

    Google Scholar 

  9. R. Karp and R. Miller. Parallel program schemata. JCSS, 3, 1969.

    Google Scholar 

  10. R. Mayr. Lossy counter machines. Technical Report TUM-I9827, TU-München, October 1998. http://www.brauer.inforrnatik.tu-muenchen.de/~mayrri.

  11. W. Thomas. Computation Tree Logic and Regular ω-Languages. LNCS 354, 1989.

    Google Scholar 

  12. W. Thomas. Automata on Infinite Objects. In Handbook of Theo. Comp. Sci. Elsevier Sci. Pub., 1990.

    Google Scholar 

  13. R. Valk and M. Jantzen. The Residue of Vector Sets with Applications to Decidability Problems in Petri Nets. Acta Informatica, 21, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bouajjani, A., Mayr, R. (1999). Model Checking Lossy Vector Addition Systems. In: Meinel, C., Tison, S. (eds) STACS 99. STACS 1999. Lecture Notes in Computer Science, vol 1563. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49116-3_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-49116-3_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65691-3

  • Online ISBN: 978-3-540-49116-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics