Local model checking games

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

Volumn 962, Issue , 1995, Pages 1-11

  Stirling, Colin ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84947781453     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60218-6_1     Document Type: Conference Paper

References (20)

1. Andersen, H. (1994). Model checking and boolean graphs. Theoretical Comp. Science, 126, 3-30.
2. Andersen, H., Stirling, C., and Winskel, G. (1994) A compositional proof system for the modal mu-calculus. Procs LICS.
3. Arnold, A., and Niwinski, D. (1992). Fixed point characterization of weak monadic logic definable sets of trees. In Tree Automata and Languages, ed. M. Nivat and A. Podelski, Elsevier, 159-188.
4. Bernholtz, O., Vardi, M. and Wolper, P. (1994). An automata-theoretic approach to branching-time model checking. Procs. CAV 94.
5. Bradfield, J. and Stifling, C. (1990). Verifying temporal properties of processes. Lect. Notes in Comput. Science, 458, 115-125.
6. Bradfield, J. and Stifling, C. (1992). Local model checking for infinite state spaces. Theoret. Comput. Science, 96, 157-174.
7. Cleaveland, R. and Steffen, B. (1992). A linear-time model checking algorithm for the alternation-free modal mu-calculus. Lect. Notes in Comp Science, 575.
8. Condon, A. (1992). The complexity of stochastic games. Inf. and Comp., 96, 203-224.
9. Emerson, E. (1985). Automata, tableaux, and temporal logics. Lect. Notes in Comput. Science, 193, 79-87.
10. Emerson, E., and Jutla, C. (1988). The complexity of tree automata and logics of programs. Extended version from FOCS '88.
11. Emerson, E, and Lei, C. (1986). Efficient model checking in fragments of the propositional mu-calculus. In Proc. 1st IEEE Syrup. on Logic in Comput. Science, 267-278.
12. Emerson, E., 3utla, C., and Sistla, A. (1993). On model checking for fragments of μ-calculus. Lect. Notes in Comput. Sci., 697, 385-396.
13. Kozen, D. (1983). Results on the propositional mu-calculus. Theoret. Comput. Sci 27, 333-354.
14. Laxsen, K. (1992). Efficient local correctness checking. Lect. Notes in Comput. Sci., 663, 385-396.
15. Long, D., Browne, A., Clarke, E., Jha, S., and Marrero, W. (1994) An improved algorithm for the evaluation of fixpoint expressions. Procs. CA V 94.
16. Ludwig, W. (1995). A subexponential randomized algorithm for the simple stochastic game problem. Inf. and Comp, 117, 151-155.
17. Milner, R. (1989). Communication and Concurrency. Prentice Hall.
18. Muller, D., Saoudi, A. and Schupp, P. (1986). Alternating automata, the weak monadic theory of the tree and its complexity. Lect. Notes in Comput. Sci., 225, 275-283.
19. Streett, R. and Emerson, E. (1989). An automata theoretic decision procedure for the propositional mu-calculus. Inf. and Comp., 81,249-264.
20. Stirling, C. and Walker, D. (1991). Local model checking in the modal mucalculus. Theoret. Comput. Science, 89, 161-177.