Abstract
We present a model checking algorithm for safety properties that is applicable to parameterized systems and hence provides a unifying approach of model checking for parameterized systems. By analysing the conditions under which the proposed algorithm terminates, we obtain a characterisation of a subclass for which this problem is decidable. The known decidable subclasses, token rings and broadcast systems, fall in our subclass, while the main novel feature is that (unnested) quantification over index variables is allowed, which means that global guards can be expressed.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Abdulla, P. A., Bouajjani, A., Jonsson, B. and Nilsson, M. Handling global conditions in parameterized system verification. In: Proc. 12th Intl. Conf. on Computer Aided Verification. 2000, LNCS 1855.
Abdulla, P., Cerans, K., Jonsson, B. and Tsay, Y.-K. General decidability theorems for infinite-state systems. In: Proc. 11th Symp. Logic in Computer Science. 1996.
Bultan, T., Gerber, R. and Pugh, W. Symbolic model checking of infinite state systems using Presburger arithmetic. In: Proc. 9th Intl. Conf. on Computer Aided Verification. 1997, LNCS 1254.
Bouajjani, A., Jonsson, B., Nilsson, M. and Touili, T. Regular model checking. In: Proc. 12th Intl. Conf. on Computer Aided Verification. 2000, LNCS 1855.
Boigelot, B. and Wolper, P. Verifying systems with infinite but regular state space. In: Proc. 10th Intl. Conf. on Computer Aided Verification. 1998.
Delzanno, G. Automatic verification of parameterized cache coherence protocols. In: 12th Intl. Conf. on Computer Aided Verification. 2000, LNCS 1855.
Esparza, J., Finkel, A. and Mayr, R. On the verification of broadcast protocols. In: Proc. 14th Symp. Logic in Computer Science. 1999.
Emerson, E. A. and Namjoshi, K. S. Reasoning about rings. In: Proc. 22th ACM Conf. on Principles of Programming Languages. 1995.
Emerson, E. A. and Namjoshi, K. S. On model checking for non-deterministic infinite-state systems. In: Proc. 13th Symp. Logic in Computer Science. 1998.
German, S. M. and Sistla, A. P. Reasoning about systems with many processes. J. ACM, 39(3): 675–735, July 1992.
Kesten, Y., Maler, O., Marcus, M., Pnueli, A. and Shahar, E. Symbolic model checking with rich assertional languages. In: Proc. 9th Intl. Conf. on Computer Aided Verification. 1997, LNCS 1254.
Kupferman, O. and Vardi, M. Y. Model checking of safety properties. In: Proc. 11th Intl. Conf. on Computer Aided Verification. 1999, LNCS 1633.
Maidl, M. Temporal logic extended by universal quantifiers, 2001. Presented at AVIS 01 Workshop in Berlin.
Suzuki, I. Proving properties of a ring of finite state machines. Information Processing Letters, 28: 213–214, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maidl, M. (2001). A Unifying Model Checking Approach for Safety Properties of Parameterized Systems. In: Berry, G., Comon, H., Finkel, A. (eds) Computer Aided Verification. CAV 2001. Lecture Notes in Computer Science, vol 2102. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44585-4_29
Download citation
DOI: https://doi.org/10.1007/3-540-44585-4_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42345-4
Online ISBN: 978-3-540-44585-2
eBook Packages: Springer Book Archive