Symbolic algorithms for infinite-state games

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

Volumn 2154, Issue , 2001, Pages 536-550

  De Alfaro, Luca ^a   Henzinger, Thomas A ^a   Majumdar, Rupak ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTROLLERS; HYBRID SYSTEMS;

BOOLEAN COMBINATIONS; CONTROLLER SYNTHESIS; EQUIVALENCE RELATIONS; INFINITE STATE SPACE; MODULAR VERIFICATION; STRUCTURAL CHARACTERIZATION; SYMBOLIC ALGORITHMS; TERMINATION CRITERIA;

EQUIVALENCE CLASSES;

EID: 84944032701     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44685-0_36     Document Type: Conference Paper

References (20)

1. P. Abdulla and B. Jonsson. Verifying networks of timed automata. In TACAS 98, LNCS 1384, pp. 298-312. Springer-Verlag, 1998.
2. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
3. R. Alur, T. Henzinger, and O. Kupferman. Alternating-time temporal logic. In FOCS 97, pp. 100-109. IEEE Computer Society Press, 1997.
4. R. Alur, T. Henzinger, O. Kupferman, and M. Vardi. Alternating refinement relations. In CONCUR 97, LNCS 1466, pp. 163-178. Springer-Verlag, 1998.
5. A. Bouajjani, J.-C. Fernandez, and N. Halbwachs. Minimal model generation. In CAV 90, LNCS 531, pp. 197-203. Springer-Verlag, 1990.
6. J. Biichi and L. Landweber. Solving sequential conditions by finite-state strategies. Transactions of the AMS, 138:295-311, 1969.
7. E. Emerson and C. Jutla. Tree automata, mu-calculus, and determinacy. In FOCS 91, pp. 368-377. IEEE Computer Society Press, 1991.
8. E. Emerson, C. Jutla, and A. Sistla. On model checking for fragments of /u,-calculus. In CAV 93, LNCS 697, pp. 385-396. Springer-Verlag, 1993.
9. T. Henzinger, P.-H. Ho, and H. Wong-Toi. HyTecH: a model checker for hybrid systems. Software Tools for Technology Transfer, 1:110-122, 1997.
10. T. Henzinger, B. Horowitz, and R. Majumdar. Rectangular hybrid games. In CONCUR 99, LNCS 1664, pp. 320-335. Springer-Verlag, 1999.
11. T. Henzinger and R. Majumdar. A classification of symbolic transition systems. In STACS 2000, LNCS 1770, pp. 13-35. Springer-Verlag, 2000.
12. T. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. Information and Computation, 111:193-244, 1994.
13. P. Kanellakis and S. Smolka. CCS expressions, finite-state processes, and three problems of equivalence. Information and Computation, 86:43-68, 1990.
14. D. Kozen. Results on the propositional /ω-calculus. Theoretical Computer Science, 27:333-354, 1983.
15. O. Maler, A. Pnueli, and J. Sifakis. On the synthesis of discrete controllers for timed systems. In STACS 95, LNCS 900, pp. 229-242. Springer-Verlag, 1995.
16. R. McNaughton. Infinite games played on finite graphs. Annals of Pure and Applied Logic, 65:149-184, 1993.
17. A. Mostowski. Regular expressions for infinite trees and a standard form of automata. In Symp. Comp. Theory, LNCS 208, pp. 157-168. Springer-Verlag, 1984.
18. P. Ramadge and W. Wonham. Supervisory control of a class of discrete-event processes. SIAM J. Control and Optimization, 25:206-230, 1987.
19. W. Thomas. Automata on infinite objects. In J. van Leeuwen, ed., Handbook of Theoretical Computer Science, volume B, pp. 133-191. Elsevier, 1990.
20. W. Thomas. On the synthesis of strategies in infinite games. In STACS 95, LNCS 900, pp. 1-13. Springer-Verlag, 1995