Abstract
Games given by transition graphs of pushdown processes are considered. It is shown that if there is a winning strategy in such a game then there is a winning strategy which is realized by a pushdown process. This fact turns out to be connected with the model checking problem for push-down automata and the propositional μ-calculus. It is show that this model checking problem is DEXPTIME-complete.
On leave from: Institute of Informatics, Warsaw University, Banacha 2, 02-097 Warsaw, POLAND
Chapter PDF
Similar content being viewed by others
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.
References
J. Bergstra and J. Klop. Process theory based on bisimulation semantics. Volume 354 of LNCS, 1988.
O. Burkart and B. Steffen. Model checking for context-free processes. In CONCUR '92, volume 630 of LNCS, pages 123–137, 1992.
O. Burkart and B. Steffen. Pushdown processes: Parallel composition and model checking. In CONCUR '94, volume 836 of LNCS, 1994.
A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. Journal of the ACM, 28(1):114–133, 1981.
S. Christiensen and H. Huttel. Deciding issues for infinite-state processes-a survey. Bulletin of EATCS, 51:156–166, October 1993.
E. Clarke, O. Grumberg, and D. Long. Verification tools for finite-state concurrent systems. In A Decade of Concurrency, volume 803 of LNCS, pages 124–175. Springer-Verlag, 1993.
E. A. Emerson and C. Jutla. Tree automata, mu-calculus and determinacy. In Proc. FOCS 91, 1991.
E. A. Emerson, C. Jutla, and A. Sistla. On model-checking for fragments of μ-calculus. In CAV'93, volume 697 of LNCS, pages 385–396, 1993.
J. Esparza and A. Kiehn. On the model checking problem for branching time logics and basic parallel processes. In CAV '95, volume 939 of LNCS, pages 353–366, 1995.
N. Klarund. Progress measures, immediate determinacy and a subset construction for tree automata. In IEEE LICS, pages 382–393, 1992.
H. Lescow. On polynomial-size programs winning finite-state games. In CAV '95, volume 939 of LNCS, pages 239–252, 1995.
D. E. Long, A. Browne, E. M. Clarke, S. Jha, and W. R. Marrero. An improved algorithm for the evaluation of fixpoint expressions. In CAV'94, volume 818 of LNCS, pages 338–350, 1994.
A. W. Mostowski. Games with forbidden positions. Technical Report 78, University of Gdansk, 1991.
D. Muller and P. Schupp. The theory of ends, pushdown automata and second-order logic. Theoretical Computer Science, 37:51–75, 1985.
R. S. Street and E. A. Emerson. An automata theoretic procedure for the propositional mu-calculus. Information and Computation, 81:249–264, 1989.
W. Thomas. On the synthesis of strategies in infinite games. In STAGS '95, volume 900 of LNCS, pages 1–13, 1995.
I. Walukiewicz. Monadic second order logic on tree-like structures. In STAGS '96, LNCS, pages 401–414, 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Walukiewicz, I. (1996). Pushdown processes: Games and model checking. In: Alur, R., Henzinger, T.A. (eds) Computer Aided Verification. CAV 1996. Lecture Notes in Computer Science, vol 1102. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61474-5_58
Download citation
DOI: https://doi.org/10.1007/3-540-61474-5_58
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61474-6
Online ISBN: 978-3-540-68599-9
eBook Packages: Springer Book Archive