Network invariants for real-time systems

Electronic Notes in Theoretical Computer Science

Volumn 98, Issue , 2004, Pages 57-74

  Grinchtein, Olga ^a   Leucker, Martin ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

Model checking; Network invariants; Parameterized systems; Superposition

Indexed keywords

COMPUTER NETWORKS; COMPUTER SCIENCE; COMPUTER TESTING; FINITE AUTOMATA; FORMAL LOGIC; NETWORK PROTOCOLS; PROBLEM SOLVING; SYSTEMS ANALYSIS;

COMPUTER CHECKING; NETWORK INVARIANTS; PARAMETERIZED SYSTEMS; SUPERPOSITION;

REAL TIME SYSTEMS;

EID: 18944366654     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2003.10.006     Document Type: Conference Paper

References (19)

1. Abadi M, Lamport L. The existence of refinement mappings. Theoretical Computer Science. 82:1991;253-284
2. Abdulla P.A, Jonsson B. On the existence of network invariants for verifying parameterized systems. Correct system design-recent insights and advances. 1999;Springer
3. Abdulla P.A, Jonsson B. Model checking of systems with many identical timed processes. Theoretical Computer Science. 290:2002;241-264
4. Alur R. Timed automata. Proc. 11th International Computer Aided Verification Conference. Lecture Notes in Computer Science. 1633:1999;8-22
5. Asarin E, Bozga M, Kerbrat A, Maler O, Pnueli M, Rasse A. Data structures for the verification of timed automata. Maler O. Hybrid and Real-Time Systems. 1997;346-360
6. Clarke E, Grumberg O, Long D. Model Checking and Abstraction. Proceedings of the 19th Annual ACM Symposium on Principles of Programming Languages. 1992;342-354 ACM, New York
7. Clarke E.M, Grumberg O, Long D. Model checking and abstraction. POPL92. 1992
8. Cousot P, Cousot R. Abstract interpretation: A unified model for static analysis of programs by construction or approximation of fixpoints. POPL77. 1977;238-252
9. *. Proc. IFIP working conference on Programming Concepts, Methods and Calculi (PROCOMET'94). 1994
10. Gollu A, Puri A, Varaiya P. Discretization of timed automata. Proceedings of the 33rd IEEE conferene on decision and control. 1994;957-958
11. Graf, S. and H. Saidi, Construction of abstract state graphs with PVS, 1254 (1997)
12. Jonsson B. Compositional specification and verification of distributed systems. ACM Transactions on Programming Languages and Systems. 16:1994;259-303
13. Kesten Y, Pnueli A. Control and data abstraction: The cornerstones of practical formal verification. Software Tools for Technology Transfer. 2:2000;328-342
14. Kurshan R.P, McMillan K.L. A structural induction theorem for processes. Information and Computation. 117:1995;1-11
15. Lesens D, Saïdi H. Abstraction of parameterized networks. Moller F. Infinity'97, Second International Workshop on Verification of Infinite State System. Electronic Notes in Theoretical Computer Science. 9:2000
16. Pnueli A, Shahar E. A platform combining deductive with algorithmic verification. Alur Rajeev, Henzinger Thomas A. Proceedings of the Eighth International Conference on Computer Aided Verification CAV. Lecture Notes in Computer Science. 1102:1996;184-195
17. Schneider F.B, Bloom B, Marzullo K. Putting time into proof outlines. de Bakker, Huizing, de Roever, Rozenberg. Real-Time: Theory in Practice. LNCS. 600:1992
18. Taşiran S, Alur R, Kurshan R.P, Brayton R.K. Verifying abstractions of timed systems. Montanari U, Sassone V. CONCUR '96: Concurrency Theory, 7th International Conference. Lecture Notes in Computer Science. 1119:1996;546-562
19. Wolper P, Lovinfosse V. Verifying properties of large sets of processes with network invariants. Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems. Lecture Notes in Computer Science. 407:1989;68-80