Parameterized model checking of ring-based message passing systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3210, Issue , 2004, Pages 325-339

  Allen Emerson, E ^a   Kahlon, Vineet ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; MODEL CHECKING; RECONFIGURABLE HARDWARE; TEMPORAL LOGIC;

BI-DIRECTIONAL RINGS; CORRECTNESS PROPERTIES; DECISION PROCEDURE; LEADER ELECTION PROBLEM; LINEAR TIME LOGIC; MESSAGE PASSING SYSTEMS; PARAMETERIZED MODEL CHECKING; UNIDIRECTIONAL RINGS;

MESSAGE PASSING;

EID: 35048862905     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (18)

1. P. Abdulla, A. Boujjani, B. Jonsson and M. Nilsson. Handling global conditions in parameterized systems verification. CAV 1999.
2. P. Abdulla and B. Jonsson. On the existence of network invariants for verifying parameterized systems. In Correct System Design - Recent Insights and Advances, 1710, LNCS, pp 180-197, 1999.
3. K. Apt and D. Kozen. Limits for automatic verification of finite-state concurrent systems. Information Processing Letters, 15, pages 307-309, 1986.
4. T. Arons, A. Pnueli, S. Ruah, J, Xu and L. Zuck. Parameterized Verification with Automatically Computed Inductive Assertions. CAV 2001, LNCS 2102, 2001.
5. M.C. Browne, E.M. Clarke and O. Grumberg. Reasoning about Networks with Many Identical Finite State Processes. Information and Control, 81(1), pages 13-31, April 1989.
6. E.M. Clarke, O. Grumberg and S. Jha. Verifying Parameterized Networks using Abstraction and Regular Languages. CONCUR 95. LNCS 962, pages 395-407, Springer-Verlag, 1995.
7. E.A. Emerson and V. Kahlon. Reducing Model Checking of the Many to the Few. CADE-17. LNCS , Springer-Verlag, 2000.
8. E.A. Emerson and V. Kahlon. Model Checking Large-Scale and Parameterized Resource Allocation Systems. TACAS, 2002.
9. E.A. Emerson and V. Kahlon. Rapid Parameterized Model Checking of Snoopy Cache Coherence Protocols. TACAS, 2003.
10. E.A. Emerson and V. Kahlon. Model Checking Guarded Protocols. LICS, 2003.
11. E.A. Emerson and K.S. Namjoshi. Reasoning about Rings. POPL. pages 85-94, 1995.
12. E.A. Emerson and K.S. Namjoshi. Automatic Verification of Parameterized Synchronous Systems. CAV. LNCS, Springer-Verlag, 1996.
13. S.M. German and A.P. Sistla. Reasoning about Systems with Many Processes. J. ACM,39(3), July 1992.
14. R.P. Khurshan and L. McMillan. A Structural Induction Theorem for Processes. PODC. pages 239-247, 1989.
15. N. Lynch. Distributed Algorithms, Morgam-Kaufmann, 1996.
16. C.E. Shannon, A Universal Turing Machine with Two Internal States. Automata Studies. Princeton, NJ: Princeton University Press, pp. 157-165, 1956.
17. I. Suzuki. Proving properties of a ring of finite state systems. IPL, 28, pages 213-314, 1988.
18. P. Wolper and V. Lovinfosse. Verifying Properties of Large Sets of Processes with Network Invariants. In J. Sifakis(ed)Automatic Verification Methods for Finite State Systems, SpringerVerlag, LNCS 407,1989.