From quantity to quality

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

Volumn 1201, Issue , 1997, Pages 48-62

  Henzinger, Thomas A ^a   Kupferman, Orna ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; CONTINUOUS TIME SYSTEMS; INTERACTIVE COMPUTER SYSTEMS; REAL TIME SYSTEMS; RECONFIGURABLE HARDWARE; TEMPORAL LOGIC;

CTL MODEL-CHECKING; DISCRETE DOMAINS; LOGIC MODEL CHECKING; MODEL CHECKING ALGORITHM; MODEL CHECKING PROBLEM; MODEL CHECKING TOOLS; REAL TIME CONSTRAINTS; TEMPORAL LOGIC FORMULA;

MODEL CHECKING;

EID: 84947925645     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0014712     Document Type: Conference Paper

References (25)

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 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. 1992.
4. R. Alur and T. Henzinger. Real-time logics: Complexity and expressiveness. Information and Computation, 104(1):35-77, May 1993.
5. R. Alur and T.A. Henzinger. A really temporal logic. Journal of the ACM, 41(1):181-204, 1994.
6. R.K. Brayton, G.D. Hachtel, A. Sangiovanni-Vincentelli, F. Somenzi, A. Aziz, S.- T. Cheng, S. Edwards, S. Khatri, T. Kukimoto, A. Pardo, S. Qadeer, R.K. Ran j an, S. Sarwary, T.R. Shiple, G. Swamy, and T. Villa. VIS: a system for verification and synthesis. In Computer Aided Verification, Proc. 8th Int. Workshop, volume 1102 of Lecture Notes in Computer Science, pages 428-432. Springer-Verlag, 1996.
7. O. Bemholtz, M.Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. In Computer Aided Verification, Proc. 6th Int. Conference, volume 818 of Lecture Notes in Computer Science, pages 142-155, 1994
8. S. Campos, E.M. Clarke, W. Marrero, M. Minea, and H. Hiraishi. Computing quantitative characteristics of finite-state real-time systems. In Proceedings of the 15 th Annual Real-time Systems Symposium. IEEE Computer Society Press, 1994
9. E.M. Clarke and 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. ACM Transactions on Programming Languages and Systems, 8(2):244-263, January 1986
11. E.M. Clarke, O. Grumberg, and D. Long. Verification tools for finite-state concurrent systems. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Decade of Concurrency — Reflections and Perspectives (Proceedings of REX School), Lecture Notes in Computer Science, pages 124-175. Springer-Verlag, 1993.
12. 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.
13. J.-C. Fernandez, H. Garavel, A. Kerbrat, L. Mounier, R. Mateescu, and M. Sighireanu. CADP: a protocol validitation and verification toolbox. In Computer Aided Verification, Proc. 8th Int. Workshop, volume 1102 of Lecture Notes in Computer Science, pages 437-440. Springer-Verlag, 1996.
14. T.A. Henzinger. Hybrid automata with finite bisimulations. In Z. Fiilop and Gecseg, editors, ICALP 95: Automata, Languages, and Programming, Lecture Notes in Computer Science 944, pages 324-335. Springer-Verlag, 1995.
15. T.A. Henzinger, O. Kupferman, and M.Y. Vardi. A space-efficient on-the-fly algorithm for real-time model checking. In Proc. 7th Conferance on Concurrency Theory, Pisa, August 1996. Springer-Verlag.
16. T.A. Henzinger, Z. Manna, and A. Pnueli. What good are digital clocks? In W. Kuich, editor, ICALP 92: Automata, Languages, and Programming, Lecture Notes in Computer Science 623, pages 545-558. Springer-Verlag, 1992.
17. T.A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. Information and Computation, 111:193-244, 1994.
18. O. Kupferman and O. Grumberg. Buy one, get one free! Journal of Logic and Computation, 6(4), 1996.
19. 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. Springer-Verlag.
20. 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. Springer-Verlag.
21. K.L. McMillan. Symbolic model checking. Kluwer Academic Publishers, 1993.
22. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, Berlin, January 1992.
23. A. Pnueli. The temporal logic of programs. In Proc. 18th IEEE Symposium on Foundation of Computer Science, pages 46-57, 1977.
24. J.P. Queille and J. Sifakis. 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.
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