Pushdown processes: Games and model-checking

Information and Computation

Volumn 164, Issue 2, 2001, Pages 234-263

  Walukiewicz, Igor ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; GRAPH THEORY; POLYNOMIALS;

PUSHDOWN AUTOMATA;

AUTOMATA THEORY;

EID: 0035966855     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2000.2894     Document Type: Conference Paper

References (26)

1. Bergstra, J., and Klop, J. (1988). Process theory based on bisimulation semantics, in "Linear Time. Branching Time and Partial Order in Logics and Models for Concurrency" (de Bakker, de Rover, and Rozemberg. Eds.). Lecture Notes in Computer Science. Vol. 354.
2. Burkart, O., and Steffen, B. (1992), Model checking for context-free processes, in "CONCUR '92," Lecture Notes in Computer Science, Vol. 630. pp. 123-137.
3. Burkart, O., and Steffen, B. (1994), Pushdown processes: Parallel composition and model checking. in "CONCUR '94," Lecture Notes in Computer Science. Vol. 836.
4. Caucal, D., and Monfort, R. (1991). On the transition graphs of automata and grammars, in "Graph-Theoretic Concepts in Computer Science," WG'90. Lecture Notes in Computer Science. Vol. 484.
5. Chandra, A. K., Kozen, D. C., and Stockmeyer, L. J. (1981), Alternation. J. ACM 28(1). 114-133.
6. Christiensen, S., and Huttel, H. (October 1993). Deciding issues for infinite-state processes a survey. Bulletin of EATCS 51, 156-166.
7. Courcelle, B., and Walukiewicz, I., "Monadic Second-Order Logic. Graphs and Unfoldings of Transition Systems." University of Aarhus. BRICS report RS-95-44. Presented at CSL '95. to appear in Journal of Pure and Applied Logic.
8. Emerson, E. A. (1985). Automata, tableaux and temporal logic, in "College Conference on Logic of Programs" Lecture Notes in Computer Science. Vol. 193. Springer-Verlag.
9. Emerson, E. A., Jutla, C., and Sistla, A. (1993). On model-checking for fragments of μ-calculus. in "CAV '93" Lecture Notes in Computer Science. Vol. 697. pp. 385-396.
10. Emerson, E. A., and Jutla, C. S. (1991). Tree automata, mu-calculus and determinacy, in "Proc. FOCS 91," pp. 368-377.
11. Emerson, E. A., and Lei, C. (1986) Efficient model checking in fragments of propositional mu-calculus, in, "First IEEE Symposium on Logic in Computer Science." pp. 267-278.
12. Esparza, J., and Kiehn, A. (1995), On the model checking problem for branching time logics and basic parallel processes, in "CAV '95." Lecture Notes in Computer Science, Vol. 939. pp. 353-366.
13. Gurevich, Y., and Harrington, L. (1982), Trees, automata and games, in "14th Symp. on Theory of Computations, ACM." pp. 60-65.
14. Klarlund N. (1992). Progress measures, immediate determinacy and a subset construction for tree automata, in "LICS '92." pp. 382-393.
15. Long, D. E., Browne, A., Clarke, E., M., Jha, S., and Marrero, W. R. (1994). An improved algorithms for the evaluation of fixpoint expressions, in "CAV '94" Lecture Notes in Computer Science, Vol. 818. pp. 338-350.
16. Mostowski, A. W. (1984), Regular expressions for infinite trees and a standard form of automata. in "Fifth Symposium on Computation Theory" (A. Skowron. Ed.). Lecture Notes in Computer Science. Vol. 208. pp 157-168.
17. Mostowski, A. W. (1991). "Games with forbidden positions." Technical Report 78. University of Gdansk.
18. Muller, D., and Schupp, P. (1985). The theory of ends. pushdown automata and second-order logic. Theor. Comp. Sci. 37. 51-75.
19. Nerode, A., Yakhnis, A., and Yakhnis, S. (1992). Concurrent programs as strategies in games, in "Logic from Computer Science" (Y. Moschovakis, Ed.). Springer-Verlag.
20. Niwiński, D. (1997) Fixed point characterization of infinite behaviour of finite state systems. Theor. Comp. Sci. 189. 1-69.
21. Niwiński, D., and Walukiewicz, I. (1996). Games for μ-calculus, Theor. Comp. Sci. 163, 99-116.
22. Seibert, S. (1996), "Effektive Strategiekonstruktion für Gale-Stewart-Spiele auf Trasitions Graphen." Ph.D. thesis. Kiel University.
23. Seidl, H. (1996). Fast and simple nested fixpoints, Inform. Proc. Lett. 59(6). 303-308.
24. Streett, R. S., and Emerson, E. A. (1989), An automata theoretic procedure for the propositional mu-calculus, Inform and Comput. 81. 249-264.
25. Thomas, W. (1995). On the synthesis of strategies in infinite games, in "STACS '95," Lecture Notes in Computer Science, Vol. 900. pp. 1-13.
26. Thomas, W. (1997). Languages, automata, and logic, in "Handbook of Formal Languages" (G, Rozenberg and A. Salomaa, Eds.). Vol. 3. Springer-Verlag.