A classification of symbolic transition systems

ACM Transactions on Computational Logic

Volumn 6, Issue 1, 2005, Pages 1-32

  Henzinger, Thomas A ^a   Majumdar, Rupak ^a   Raskin, Jean François ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Hybrid automata; Infinite state model checking; Model checking; State equivalences; Symbolic algorithms; Temporal logics

Indexed keywords

BOOLEAN OPERATIONS; HYBRID AUTOMATA; INFINITE-STATE MODEL CHECKING; MODEL CHECKING; STATE EQUIVALENCE; SYMBOLIC ALGORITHM; TEMPORAL LOGICS;

BOOLEAN FUNCTIONS; FINITE AUTOMATA; FORMAL LOGIC; GRAPH THEORY; HYBRID COMPUTERS; MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING;

COMPUTER SCIENCE;

EID: 11444249649     PISSN: 15293785     EISSN: None     Source Type: Journal    
DOI: 10.1145/1042038.1042039     Document Type: Article

References (40)

1. ABDULLA, P. AND JONSSON, B. 1998. Verifying networks of timed automata. In TACAS 98: Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, vol. 1384. Springer-Verlag, New York, 298-312.
2. ABDULLA, P., ČERĀNS, K., JONSSON, B., AND TSAY, Y.-K. 1996. General decidability theorems for infinite-state systems. In Proceedings of the 11th Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 313-321.
3. ALUR, R., COURCOUBETIS, C., HALBWACHS, N., HENZINGER, T., HO, P.-H., NICOLLIN, X., OLIVERO, A., SIFAKIS, J., AND YOVINE, S. 1995. The algorithmic analysis of hybrid systems. Theoret. Comput. Sci. 138, 3-34.
4. ALUR, R. AND DILL, D. 1994. A theory of timed automata. Theoret. Comput. Sci. 126, 183-235.
5. ALUR, R. AND HENZINGER, T. 1998. Computer-Aided Verification: An Introduction to Model Building and Model Checking for Concurrent Systems. Draft.
6. ALUR, R., HENZINGER, T., AND Ho, P.-H. 1996. Automatic symbolic verification of embedded systems. IEEE Trans. Softw. Eng. 22, 181-201.
7. BERMAN, L. 1980. The complexity of logical theories. Theoret. Comput. Sci. 11, 71-77.
8. BHAT, G. AND CLEAVELAND, R. 1996. Efficient model checking via the equational μ-calculus. In Proceedings of the 11th Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 304-312.
9. BOUAJJANI, A., FERNANDEZ, J.-C., AND HALBWACHS, N. 1990. Minimal model generation. In CAV 90: Computer-Aided Verification. Lecture Notes in Computer Science, vol. 531. Springer-Verlag, New York, 197-203.
10. BROWNE, M., CLARKE, E. M., AND GRUMBERG, O. 1988. Characterizing finite Kripke structures in prepositional temporal logic. Theoret. Comput. Sci. 59, 115-131.
11. 20 states and beyond. Inf. Comput. 98, 142-170.
12. BUSTAN, D. AND GRUMBERG, O. 2003. Simulation-based minimization. ACM Trans. Computat. Logic 4, 181-206.
13. CLARKE, E. M., GRUMBERG, O., AND LONG, D. 1994. Verification tools for finite-state concurrent systems. In A Decade of Concurrency: Reflections and Perspectives. Lecture Notes in Computer Science, vol. 803. Springer-Verlag, New York, 124-175.
14. CLEAVELAND, R., KLEIN, M., AND STEFFEN, B. 1992. Faster model checking for the modal μ-calculus. In CAV 92: Computer-Aided Verification. Lecture Notes in Computer Science, vol. 663. Springer-Verlag, New York, 410-422.
15. COOPER, D. C. 1972. Theorem proving in arithmetic without multiplication. Mach. Intel. 7, 91-100.
16. COUSOT, P. AND COUSOT, R. 1977. Abstract interpretation: A unified lattice model for the static analysis of programs by construction or approximation of fixpoints. In Proceedings of the 4th Annual Symposium on Principles of Programming Languages. ACM, New York, 238-252.
17. DAM, M. 1994. CTL* and ECTL* as fragments of the modal μ-calculus. Theoret. Comput. Sci. 126, 77-96.
18. EMERSON, E. 1990. Temporal and modal logic. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. Vol. B. Elsevier Science Publishers, Amsterdam, The Netherlands, 995-1072.
19. EMERSON, E., JUTLA, C., AND SISTLA, A. 1993. On model checking for fragments of μ-calculus. In CAV 93: Computer-Aided Verification. Lecture Notes in Computer Science, vol. 697. Springer-Verlag, New York, 385-396.
20. EMERSON, E., JUTLA, C., AND SISTLA, A. 2001. On model checking for the μ-calculus and its fragments. In Theoret. Comput. Sci. 258, 491-522.
21. EMERSON, E. AND LEI, C. 1986. Efficient model checking in fragments of the propositional μ-calculus. In Proceedings of the 1st Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 267-278.
22. FINKEL, A. AND SCHNOEBELEN, P. 1998. Well-structured Transition Systems Everywhere. Tech. Rep. LSV-98-4, Laboratoire Spécification et Vérification, ENS de Cachan, France.
23. HENZINGER, M., HENZINGER, T., AND KOPKE, P. 1995. Computing simulations on finite and infinite graphs. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 453-462.
24. HENZINGER, T. 1995. Hybrid automata with finite bisimulations. In ICALP 95: Automata, Languages, and Programming. Lecture Notes in Computer Science, vol. 944. Springer-Verlag, New York, 324-335.
25. HENZINGER, T. 1996. The theory of hybrid automata. In Proceedings of the 11th Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 278-292.
26. HENZINGER, T., HO, P.-H., AND WONG-TOI, H. 1995. HYTECH: The next generation. In Proceedings of the 16th Annual Real-Time Systems Symposium. IEEE Computer Society Press, Los Alamitos, Calif., 56-65.
27. HENZINGER, T. AND KOPKE, P. 1996. State equivalences for rectangular hybrid automata. In CONCUR 96: Concurrency Theory. Lecture Notes in Computer Science, vol. 1119. Springer-Verlag, New York, 530-545.
28. HENZINGER, T., KOPKE, P., PURI, A., AND VARAIYA, P. 1998. What's decidable about hybrid automata? J. Comput. Syst. Sci. 57, 94-124.
29. HENZINGER, T. AND MAJUMDAR, R. 2000. Symbolic model checking for rectangular hybrid systems. In TACAS 00: Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, vol. 1785. Springer-Verlag, New York, 142-156.
30. HENZINGER, T., NICOLLIN, X., SIFAKIS, J., AND YOVINE, S. 1994. Symbolic model checking for real-time systems. Inf. Comput. 111, 193-244.
31. HOPCROFT, J. AND ULLMAN, J. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley.
32. JANIN, D. AND WALUKIEWICZ, I. 1996. On the expressive completeness of the prepositional μ-calculus with respect to the monadic second order logic. In CONCUR 96: Concurrency Theory. Lecture Notes in Computer Science, vol. 1119. Springer-Verlag, New York, 263-277.
33. KANELLAKIS, P. AND SMOLKA, S. 1990. CCS expressions, finite-state processes, and three problems of equivalence. Inf. Comput. 86, 43-68.
34. KOZEN, D. 1983. Results on the propositional μ-calculus. Theoret. Comput. Sci. 27, 333-354.
35. LAMPORT, L. 1974. A new solution of Dijkstra's concurrent programming problem. Commun. ACM 17, 453-455.
36. LOISEAUX, C., GRAF, S., SIFAKIS, J., BOUAJJANI, A., AND BENSALEM, S. 1995. Property-preserving abstractions for the verification of concurrent systems. Form. Meth. Syst. Des. 6, 11-44.
37. MILNER, R. 1971. An algebraic definition of simulation between programs. In Proceedings of the 2nd International Joint Conference on Artificial Intelligence. The British Computer Society, 481-489.
38. THOMAS, W. 1990. Automata on infinite objects. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. Vol. B. Elsevier Science Publishers, Amsterdam, The Netherlands, 133-191.
39. VAN GLABBEEK, R. 1990. Comparative Concurrency Semantics and Refinement of Actions. Ph.D. Thesis, Vrije Universiteit te Amsterdam, The Netherlands.
40. WOLPER, P. 1983. Temporal logic can be more expressive. Inf. Cont. 56, 72-99.