A space-efficient on-the-fly algorithm for real-time model checking

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

Volumn 1119, Issue , 1996, Pages 514-529

  Henzinger, Thomas A ^a   Kupferman, Orna ^b   Vardi, Moshe Y ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CLOCKS; COMPUTER CIRCUITS; ROBOTS; SPECIFICATIONS; TEMPORAL LOGIC;

AUTOMATA-THEORETIC APPROACH; LOGIC MODEL CHECKING; MINIMAL INFORMATION; MODEL CHECKING ALGORITHM; ON-THE-FLY ALGORITHMS; REAL-TIME EXTENSION; STATE EXPLOSION PROBLEMS; TEMPORAL LOGIC FORMULA;

MODEL CHECKING;

EID: 84955564686     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61604-7_73     Document Type: Conference Paper

References (29)

1. R. Alur, C. Courcoubetis, and D. Dill. Model-checking in dense real-time. Information and Computation, 104(l):2-34, May 1993.
2. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183-236, 1994.
3. R. Alur, T. Feder, and T.A. Henzinger. The benefits of relaxing punctuality. Journal of the ACM, 43(1):116-146, 1996.
4. R. Alur and T.A. Henzinger. Logics and models of real time: a survey. In J.W. de Bakker, K. Huizing, W.-P. de Roever, and G. Rozenberg, editors, Real Time: Theory in Practice, Lecture Notes in Computer Science 600, pages 74-106. Springer-Verlag, 1992.
5. R. Alur and T. Henzinger. Real-time logics: Complexity and expressiveness. Information and Computation, 104(l):35-77, May 1993.
6. R. Alur and T.A. Henzinger. A really temporal logic. Journal of the ACM, 41(l):181-204, 1994.
7. R. Alur. Techniques for Automatic Verification of Real-time Systems. PhD thesis, Stanford University, 1991.
8. O. Bemholtz, M.Y. Vardi, and P. Wolper. An automata-theoretic approach to branchingtime model checking. In D. L. Dill, editor, Computer Aided Verification, Proc. 6th Int. Conference, volume 818 of Lecture Notes in Computer Science, pages 142-155, Stanford, June 1994. Springer-Verlag.
9. E.M. Clarke said E.A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proc. Workshop on Logic of Programs, volume 131 of Lecture Notes in Computer Science, pages 52-71. Springer-Verlag, 1981.
10. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. A CM Transactions on Programming Languages and Systems, 8(2):244-263, January 1986.
11. C. Courcoubetis, M.Y. Vardi, P. Wolper, and M. Yannakakis. Memory efficient algorithms for the verification of temporal properties. Formal Methods in System Design, 1:275-288, 1992.
12. E.A. Emerson. Real time and the μ-calculus. In J.W. de Bakker, K. Huizing, W.-P. de Roever, and G. Rozenberg, editors, Real Time: Theory in Practice, Lecture Notes in Computer Science 600, pages 176-194. Springer-Verlag, 1992.
13. E.A. Emerson, A.K. Mok, A.P. Sistla, and J. Srinivasan. Quantitative temporal reasoning. In Proc. 2nd Workshop on Computer Aided Verification, volume 531 of Lecture Notes in Computer Science, pages 136-145. Springer-Verlag, 1990.
14. J.-C. Fernandez, L. Mounier, C. Jard, and T. Jeron. On-the-fly verification of finite transition systems. Formal Methods in System Design, 1:251-273, 1992.
15. T.A. Henzinger, X. Nicollin, J. Sifalds, and S. Yovine. Symbolic model checking for real-time systems. Information and Computation, 111:193-244, 1994.
16. O. Kupferman and M.Y. Vardi. On the complexity of branching modular model checking. In Proc. 6th Conferance on Concurrency Theory, pages 408-422, Philadelphia, August 1995.
17. L. Lamport. Sometimes is sometimes “not never” - on the temporal logic of programs. In Proceedings of the 7th ACM Symposium on Principles of Programming Languages, pages 174-185, January 1980.
18. F. Laroussinie and K. G. Larsen. Compositional model checking of real time systems. In Proc. 6th Conferance on Concurrency Theory, pages 27-41, Philadelphia, August 1995.
19. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, Berlin, January 1992.
20. D.E. Muller and P.E. Schupp. Alternating automata on infinite trees. Theoretical Computer Science, 54,:267-276, 1987.
21. D.E. Muller, A. Saoudi, and P.E. Schupp. Alternating automata, the weak monadic theory of the tree and its complexity. In Proc. 13th Int. Colloquium on Automata, Languages and Programming. Springer-Verlag, 1986.
22. A. Pnueli. The temporal logic of programs. In Proc. 18th IEEE Symposium on Foundation of Computer Science, pages 46-57, 1977.
23. J.P. Queille and J. Sifalds. Specification and verification of concurrent systems in Cesar. In Proc. 5th International Symp. on Programming, volume 137, pages 337-351. Springer-Verlag, Lecture Notes in Computer Science, 1981.
24. A.P. Sistla and E.M. Clarke. The complexity of propositional linear temporal logic. J. ACM, 32:733-749, 1985.
25. O.V. Sokolsky and S.A. Smolka. Local model checking for real-time systems. In Computer Aided Verification, Proc. 7th Int. Workshop, Lecture Notes in Computer Science 939, pages 211-224, Liege, July 1995.
26. C. Stirling and D. Walker. Local model checking in the modal mu-calculus. In Proc. 15th Col. on Trees in Algebra and Programming. Lecture Notes in Computer Science, 1989.
27. W. Thomas. Automata on infinite objects. Handbook of Theoretical Computer Science, pages 165-191, 1990.
28. M.Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1-37, November 1994.
29. M. Yannakakis and D. Lee. An efficient algorithm for minimizing real-time transition systems. In C. Courcoubetis, editor, Computer Aided Verification, Proc. 5th Int. Workshop, volume 697 of Lecture Notes in Computer Science 697, pages 210-224, Elounda, Crete, June Lecture Notes in Computer Science, Springer-Verlag.