Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Andersen, H. (1994). Model checking and boolean graphs. Theoretical Comp. Science, 126, 3–30.
Andersen, H., Stirling, C., and Winskel, G. (1994) A compositional proof system for the modal mu-calculus. Procs LICS.
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.
Bernholtz, O., Vardi, M. and Wolper, P. (1994). An automata-theoretic approach to branching-time model checking. Procs. CAV 94.
Bradfield, J. and Stirling, C. (1990). Verifying temporal properties of processes. Lect. Notes in Comput. Science, 458, 115–125.
Bradfield, J. and Stirling, C. (1992). Local model checking for infinite state spaces. Theoret. Comput. Science, 96, 157–174.
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.
Condon, A. (1992). The complexity of stochastic games. Inf. and Comp., 96, 203–224.
Emerson, E. (1985). Automata, tableaux, and temporal logics. Lect. Notes in Comput. Science, 193, 79–87.
Emerson, E., and Jutla, C. (1988). The complexity of tree automata and logics of programs. Extended version from FOCS '88.
Emerson, E, and Lei, C. (1986). Efficient model checking in fragments of the propositional mu-calculus. In Proc. 1st IEEE Symp. on Logic in Comput. Science, 267–278.
Emerson, E., Jutla, C., and Sistla, A. (1993). On model checking for fragments of μ-calculus. Lect. Notes in Comput. Sci., 697, 385–396.
Kozen, D. (1983). Results on the propositional mu-calculus. Theoret. Comput. Sci 27, 333–354.
Larsen, K. (1992). Efficient local correctness checking. Lect. Notes in Comput. Sci., 663, 385–396.
Long, D., Browne, A., Clarke, E., Jha, S., and Marrero, W. (1994) An improved algorithm for the evaluation of fixpoint expressions. Procs. CAV 94.
Ludwig, W. (1995). A subexponential randomized algorithm for the simple stochastic game problem. Inf. and Comp, 117, 151–155.
Milner, R. (1989). Communication and Concurrency. Prentice Hall.
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.
Streett, R. and Emerson, E. (1989). An automata theoretic decision procedure for the propositional mu-calculus. Inf. and Comp., 81, 249–264.
Stirling, C. and Walker, D. (1991). Local model checking in the modal mucalculus. Theoret. Comput. Science, 89, 161–177.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stirling, C. (1995). Local model checking games (extended abstract). In: Lee, I., Smolka, S.A. (eds) CONCUR '95: Concurrency Theory. CONCUR 1995. Lecture Notes in Computer Science, vol 962. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60218-6_1
Download citation
DOI: https://doi.org/10.1007/3-540-60218-6_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60218-7
Online ISBN: 978-3-540-44738-2
eBook Packages: Springer Book Archive