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.
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
P. Abdulla, K. Cerans, B. Jonsson, and Y-K. Tsay. General Decidability Theorems for Infinite-state Systems. In LICS’96. IEEE, 1996.
P. Abdulla and B. Jonsson. Verifying Programs with Unreliable Channels. In LICS’93. IEEE, 1993.
P. Abdulla and B. Jonsson. Undecidable verification problems for programs with unreliable channels. Information and Computation, 130(1):71–90, 1996.
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.
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.
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.
J. Esparza. Decidability of model checking for infinite-state concurrent systems. Acta Informatica, 34:85–107, 1997.
O. Grumberg and D. Long. Model Checking and Modular Verification. ACM Transactions on Programming Languages and Systems, 16, 1994.
R. Karp and R. Miller. Parallel program schemata. JCSS, 3, 1969.
R. Mayr. Lossy counter machines. Technical Report TUM-I9827, TU-München, October 1998. http://www.brauer.inforrnatik.tu-muenchen.de/~mayrri.
W. Thomas. Computation Tree Logic and Regular ω-Languages. LNCS 354, 1989.
W. Thomas. Automata on Infinite Objects. In Handbook of Theo. Comp. Sci. Elsevier Sci. Pub., 1990.
R. Valk and M. Jantzen. The Residue of Vector Sets with Applications to Decidability Problems in Petri Nets. Acta Informatica, 21, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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