Network invariants for real-time systems

Formal Aspects of Computing

Volumn 20, Issue 6, 2008, Pages 619-635

  Grinchtein, Olga ^a   Leucker, Martin ^b  

^a UPPSALA UNIVERSITY   (Sweden)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Network invariants; Parameterized systems; Real time systems

Indexed keywords

ABSTRACTING; COMPUTER NETWORKS; MODEL CHECKING; TIME SHARING SYSTEMS;

DISCRETIZATION; FINITE SYSTEMS; MODEL CHECKERS; MUTUAL EXCLUSIONS; NETWORK INVARIANTS; NETWORKS OF PROCESSES; PARAMETERIZED; PARAMETERIZED SYSTEMS; SIMPLE PROTOCOLS; SPI-RIT; TEMPORAL PROPERTIES; TIMED AUTOMATONS; TIMED SYSTEMS; TRANSITION STRUCTURES;

REAL TIME SYSTEMS;

EID: 57249095836     PISSN: 09345043     EISSN: 1433299X     Source Type: Journal    
DOI: 10.1007/s00165-008-0089-0     Document Type: Article

References (31)

1. Asarin E, Bozga M, Kerbrat A, Maler O, Pnueli M, Rasse A (1997) Data structures for the verification of timed automata. In: Maler O (ed) Hybrid and real-time systems. Lecture notes in computer science, Grenoble, France, vol 1201. Springer, Heidelberg, pp 346-360
2. Alur R, Dill D (1990) Automata for modeling real-time systems. In: Automata, languages and programming. Springer, Heidelberg, pp 322-335
3. R Alur DL Dill 1994 A theory of timed automata Theor Comput Sci 126 2 183 235
4. Abdulla PA, Jonsson B (1999) On the existence of network invariants for verifying parameterized systems. In: Correct system design-recent insights and advances. Springer, Heidelberg, pp 180-197
5. PA Abdulla B Jonsson 2002 Model checking of systems with many identical timed processes Theor Comput Sci 290 1 241 264
6. M Abadi L Lamport 1991 The existence of refinement mappings Theor Comput Sci 82 2 253 284
7. Alur R (1999) Timed automata. In: Proceedings of 11th international computer aided verification conference. Lecture notes in computer science, vol 1633. Springer, Heidelberg, pp 8-22
8. Cousot P, Cousot R (1977) Abstract interpretation: a unified model for static analysis of programs by construction or approximation of fixpoints. In: Proceedings of 4th ACM symposium on principles of programming languages, pp 238-252
9. Clarke E, Grumberg O, Long D (1992) Model checking and abstraction. In: Proceedings of the 19th annual ACM symposium on principles of programming languages. ACM, New York, pp 342-354
10. Clarke EM, Grumberg O, Peled DA (1999) Model checking. The MIT Press, Cambridge
11. Dams D, Grumberg O, Gerth R (1994) Abstract interpretation of reactive systems: abstractions preserving ∀CTL, ∃CTL and CTL. In: Proceedings of IFIP working conference on programming concepts, methods and calculi (PROCOMET'94), pp. 573-592
12. Grinchtein O, Leucker M (2004) Network invariants for real-time systems. In: Fifth international workshop on verification of infinite-state systems. Electronic notes in theoretical computer science, vol 98. Elsevier, Amsterdam, pp 57-74
13. Grinchtein O, Leucker M, Piterman N (2006) Inferring network invariants automatically. In: Proceedings of the 3rd international joint conference on automated reasoning (IJCAR'06). Lecture notes in artificial itelligence, vol 4130
14. Gollu A, Puri A, Varaiya P (1994) Discretization of timed automata. In: Proceedings of the 33rd IEEE conferene on decision and control, pp 957-958
15. Grinchtein O (2002) Dense-time analysis with fractional adjustment steps. Master's thesis, The Weizmann Institue of Science, Rehovot 76100, Israel, July
16. Grumberg O (2005) Abstraction and refinement in model checking. In: Boer FS, Bonsangue MM, Graf S, Roever WP (eds) FMCO. Lecture notes in computer science, vol 4111. Springer, Heidelberg, pp 219-242
17. Graf S, Saidi H (1997) Construction of abstract state graphs with PVS. In: Proceedings of 9th international conference on computer aided verification, Haifa, Israel, vol 1254. Springer, Heidelberg, pp 72-83
18. B Jonsson 1994 Compositional specification and verification of distributed systems ACM Trans Program Lang Syst 16 2 259 303
19. RP Kurshan KL McMillan 1995 A structural induction theorem for processes Inf Comput 117 1 1 11
20. Y Kesten A Pnueli 2000 Control and data abstraction: the cornerstones of practical formal verification Softw Tools Technol Transf 2 4 328 342
21. Lesens D, Halbwachs N, Raymond P (1997) Automatic verification of parameterized linear networks of processes. In: Proceedings of 24th ACM symposium on principles of programming languages
22. Lichtenstein O, Pnueli A (1985) Checking that finite state concurrent programs satisfy their linear specification. In: Proceedings of the twelfth annual ACM symposium on principles of programming languages. ACM, New York, pp 97-107
23. Lesens D, Saïdi H (2000) Abstraction of parameterized networks. In: Moller F (ed) Infinity'97, second international workshop on verification of infinite state system. Electronic notes in theoretical computer science, vol 9. Elsevier, Amsterdam
24. Ouaknine J, Worrell J (2003) Revisiting digitization, robustness, and decidability for timed automata. In: Proceedings of the 18th annual IEEE symposium on logic in computer science (LICS'03). IEEE Computer Society, New York
25. Pnueli A (1977) The temporal logic of programs. In: Proceedings of the 18th IEEE symposium on the foundations of computer science (FOCS-77), Providence, Rhode Island, October 31-November 2, 1977. IEEE Computer Society Press, New York, pp 46-57
26. Pnueli A, Shahar E (1996) A platform combining deductive with algorithmic verification. In: Alur R, Henzinger TA (eds) Proceedings of the eighth international conference on computer aided verification CAV, New Brunswick, NJ, USA, July/August 1996. Lecture notes in computer science, vol 1102. Springer, Heidelberg, pp 184-195
27. Schneider FB, Bloom B, Marzullo K (1992) Putting time into proof outlines. In: de Bakker, Huizing, de Roever, and Rozenberg (eds) Real-time: theory in practice. Lecture notes in computer science, vol 600, pp 618-639
28. TaşIran S, Alur R, Kurshan RP, Brayton RK (1996) Verifying abstractions of timed systems. In: Montanari U, Sassone V (eds) CONCUR '96: concurrency theory, 7th international conference. Lecture notes in computer science, Pisa, Italy, 26-29 August 1996, vol 1119. Springer, Heidelberg, pp 546-562
29. Vardi MY (1996) An automata-theoretic approach to linear temporal logic. Lecture notes in computer science, vol 1043. Springer, New York, pp 238-266
30. Vardi MY, Wolper P (1986) An automata-theoretic approach to automatic program verification. In: Symposium on logic in computer science (LICS'86), Washington, D.C., USA. IEEE Computer Society Press, New York, pp 332-345
31. Wolper P, Lovinfosse V (1989) Verifying properties of large sets of processes with network invariants. In: Proceedings of the international workshop on automatic verification methods for finite state systems. Lecture notes in computer science, Grenoble, France, vol 407. Springer, Heidelberg, pp 68-80