Symbolic model checking for real-time systems

Information and Computation

Volumn 111, Issue 2, 1994, Pages 193-244

  Henzinger, Thomas A ^a   Nicollin, Xavier ^b   Sifakis, Joseph ^b   Yovine, Sergio ^b  

^a Department of Obstetrics Gynecology   (United States)

^b VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000217258     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1006/inco.1994.1045     Document Type: Article

References (39)

1. Alur, R., Courcoubbtis, C., and Dill, D. L. (1990), Model checking for real-time systems, in "Proceedings of the Fifth Annual Symposium on Logic in Computer Science," pp. 414-425, IEEE Computer Society Press, Los Alamitos, CA.
2. Alur, R., Courcoubetis, C., Halbwachs, N., Dill, D. L., and Wong-Toi, H. (1992), Minimization of timed transition systems, in "CONCUR 92: Theories of Concurrency" (S. A. Smolka, Ed.), Lecture Notes in Computer Science, Vol. 630, pp. 340-354, Springer-Verlag, New York/Berlin.
3. Alur, R., Courcoubetis, C., Henzinger, T. A., and Ho, P.-H. (1993), Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems, in "Hybrid Systems" (R. L. Grossman, A. Nerode, A. P. Raun, and H. Rischel, Eds.), Lecture Notes in Computer Science, Vol.736, pp. 209-229, Springer-Verlag, New York/Berlin.
4. Alur, R., and Dill, D. L. (1990), Automata for modeling real-time systems, in "ICALP 90: Automata, Languages, and Programming" (M. S. Paterson, Ed.), Lecture Notes in Computer Science, Vol. 443, pp. 322-335, Springer-Verlag, New York/Berlin.
5. Alpern, B., Demers, A. J., and Schneider, F. B. (1990), Safety without stuttering, Inform. Process. Lett. 23 (4), 177-180.
6. Alur, R., Feder, T., and Henzinger, T. A. (1991), The benefits of relaxing punctuality, in "Proceedings of the Tenth Annual Symposium on Principles of Distributed Computing, pp. 139-152, ACM Press, New York.
7. Alur, R., and Henzinger, T. A. (1989), A really temporal logic, in "Proceedings of the 30th Annual Symposium on Foundations of Computer Science," pp. 164-169, IEEE Computer Society Press, Los Alamitos, CA.
8. Alur, R., and Henzinger, T. A. (1992a), Back to the future: Towards a theory of timed regular languages, in "Proceedings of the 33rd Annual Symposium on Foundations of Computer Science," pp. 177-186, IEEE Computer Society Press, Los Alamitos, CA.
9. Alur, R., and Henzinger, T. A. (1992b), Logics and models of real time: A survey, in "Real Time: Theory in Practice" (J. W. de Bakker, K. Huizing, W.-P. de Roever, and G. Rozenberg, Eds), Lecture Notes in Computer Science, Vol. 600, pp. 74-106, Springer-Verlag, New York/Berlin.
10. Alur, R., Henzinger, T. A., and Ho, P.-H. (1993), Automatic symbolic verification of embedded systems, in "Proceedings of the 14th Annual Real-Time Systems Symposium, pp. 2-11, IEEE Computer Society Press, Los Alamitos, CA.
11. Abadi, M., and Lamport, L. (1988), The existence of refinement mappings, in "Proceedings of the Third Annual Symposium on Logic in Computer Science," pp. 165-175, IEEE Computer Society Press, Los Alamitos, CA.
12. Abadi, M., and Lamport, L. (1992), An old-fashioned recipe for real time, in "Real Time: Theory in Practice" (J. W. de Bakker, K. Huizing, W.-P. de Roever, and G. Rozenberg, Eds.), Lecture Notes in Computer Science, Vol. 600, pp. 1-27, Springer-Verlag, New York, Berlin.
13. Alur, R. (1991), "Techniques for Automatic Verification of Real-Time Systems," Ph.D. thesis, Stanford Univ., Stanford.
14. 20 states and beyond, Inform. and Comput. 98 (2), 142-170.
15. Bryant, R. E. (1986), Graph-based algorithms for boolean function manipulation, IEEE Trans. Comput. C-35 (8), 677-691.
16. Coudert, O., Berthet, C., and Madre, J. (1989), Verification of synchronous sequential machines based on symbolic execution, in "CAV 89: Automatic Verification Methods for Finite-State Systems" (J. Sifakis, Ed.), Lecture Notes in Computer Science, Vol. 407, pp. 365-373, Springer-Verlag, New York/Berlin.
17. Clarke, E. M., Emerson, E. A., and Sistla, A. P. (1986), Automatic verification of finite-state consurrent systems using temporal-logic specifications, ACM Trans. Programming Languages Systems 8 (2), 244-263.
18. Dill, D. L. (1989), Timing assumptions and verification of finite-state concurrent systems, in "CAV 89: Automatic Verification Methods for Finite- State Systems" (J. Sifakis, Ed.), Lecture Notes in Computer Science, Vol. 407, pp. 197-212, Springer-Verlag, New York/Berlin.
19. Emerson, E. A., and Clarke, E. M. (1980), Characterizing correctness properties of parallel programs as fixpoints, in "ICALP 83: Automata, Languages, and Programming," Lecture Notes in Computer Science, Vol. 85, pp. 169-181, Springer-Verlag, New York/Berlin.
20. Emerson, E. A., and Clarke, E. M. (1982), Using branching-time temporal logic to synthesize synchronization skeletons, Sci. Comput. Programming 2 (3), 241-266.
21. Emerson, E. A., and Halpern, J. Y. (1986), "Sometimes" and "Not never" revisited: On branching versus linear-time temporal logic, J. Assoc. Comput. Mach. 33 (1), 151-178.
22. Emerson, E. A., and Lei, C. (1986), Efficient model checking in fragments of the propositional л-calculus, in "Proceedings of the First Annual Symposium on Logic in Computer Science," pp. 267-278, IEEE Computer Society Press, Los Alamitos, CA.
23. Emerson, E. A. (1983), Alternative semantics for temporal logics, Theor. Comput. Sci. 26 (1), 121-130.
24. Emerson, E. A. (1990), Temporal and modal logic, in "Handbook of Theoretical Computer Science" (J. van Leeuwen, Ed.), Vol. B, pp. 995-1072, Elsevier, Amsterdam.
25. Emerson, E. A. (1992), Real time and the л-calculus, in "Real Time: Theory in Practice" (J. W. de Bakker, K. Huizing, W.-P. de Roever, and G. Rozenberg, Eds.), Lecture Notes in Computer Science, Vol. 600, pp. 176-194, Springer- Verlag, New York/Berlin.
26. Emerson, E. A., Mok, A. K., Sistla, A. P., and Srinivasan, J. (1990), Quantitative temporal reasoning, in "CAV 90: Computer-Aided Verification" (R. P. Kurshan and E. M. Clarke, Eds.), Lecture Notes in Computer Science, Vol. 531, pp. 136-145, Springer-Verlag, New York/Berlin.
27. Ferrante, J., and Rackoff, C. (1975), A decision procedure for the first-order theory of real addition with order, SIAM J. Comput. 4 (1), 69-76.
28. Henzinger, T. A. (1992), Sooner is safer than later, Inform. Process. Lett. 43, 135-141.
29. Holmer, U., Larsen, K., and Wang, Y. (1991), Deciding properties of regular real timed processes, in "CAV 91: Computer-Aided Verification" (K. Larsen and A. Skou, Eds.), Lecture Notes in Computer Science, Vol. 575, pp. 443-453. Springer-Verlag, New York/Berlin.
30. Henzinger, T. A., Manna, Z., and Pnueli, A. (1991), Temporal proof methodologies for real-time systems, in "Proceedings of the 18th Annual Symposium on Principles of Programming Languages," pp. 353-366, ACM Press, New York.
31. Kozen, D. (1983), Results on the propositional л-calculus, Theor. Comput. Sci. 27 (3), 333-354.
32. Lewis, H. R. (1990), A logic of concrete time intervals, in "Proceedings of the Fifth Annual Symposium on Logic in Computer Science," pp. 380-389, IEEE Computer Society Press, Los Alamitos, CA.
33. McMillan, K. L. (1993), "Symbolic Model Checking: An Approach to the State Explosion Problem," Kluwer, Dordrecht.
34. Nicollin, X., Olivero, A., Sifakis, J., and Yovine, S. (1933), An approach to the description and analysis of hybrid systems, in "Hybrid Systems" (R. L. Grossman, A. Nerode, A. P. Raun, and H. Rischel, Eds.), Lecture Notes in Computer Science, Vol.736, pp. 149-178, Springer-Verlag, New York/Berlin.
35. Nicollin, X., and Sifakis, J. (1991), An overview and synthesis of timed process algebras, in "CAV 91: Computer-Aided Verification" (K. Larsen and A. Skou, Eds.), Lecture Notes in Computer Science, Vol. 575, pp. 376-398, Springer-Verlag, New York/Berlin.
36. Nicollin, X., Sifakis, J., and Yovine, S. (1992), Compiling real-time specifications into extended automata, IEEE Trans. Software Engr. SE-18 (9), 794-804.
37. Nicollin, X., Sifakis, J., and Yovine, S. (1993), From ATP to timed graphs and hybrid systems, Acta Inform. 30, 181-202.
38. Queille, J., and Sifakis, J. (1981), Specification and verification of concurrent systems in CESAR, in "Fifth International Symposium on Programming" (M. Dezani-Ciancaglini and U. Montanari, Eds.), Lecture Notes in Computer Science, Vol. 137, pp. 337-351, Springer-Verlag, New York/Berlin.
39. Sifakis, J. (1982), A unified approach for studying the properties of transition systems, Theor. Comput. Sci. 18, 227-258.