Abstract
In this paper, we focus on solving games in recursive game graphs that can model the control flow in sequential programs with recursive procedure calls. While such games can be viewed as the pushdown games studied in the literature, the natural notion of winning in our framework requires the strategies to be modular with only local memory; that is, resolution of choices within a module does not depend on the context in which the module is invoked, but only on the history within the current invocation of the module. While reachability in (global) pushdown games is known to be EXPTIME-complete, we show reachability in modular games to be NP-complete. We present a fixpoint computation algorithm for solving modular games such that the worst-case number of iterations is exponential in the total number of returned values from the modules. If the strategy within a module does not depend on the global history, but can remember the history of the past invocations of this module, that is, if memory is local but persistent, we show that reachability becomes undecidable.
This research was supported in part by ARO URI award DAAD19-01-1-0473, NSF CAREER award CCR97-34115, and NSF award ITR/SY 0121431. The second author was also supported by the MIUR in the framework of the project “Metodi Formali per la Sicurezza” (MEFISTO) and MIUR grant 60% 2002.
For the details of the proofs of this paper we refer the reader to the technical report available at the URL:“http://www.cis.upenn.edu/~madhusud/”.
Chapter PDF
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
R. Alur, K. Etessami, and M. Yannakakis. Analysis of recursive state machines. In Proc. of the 13th International Conference on Computer Aided Verification, CAV’01, LNCS 2102, pages 207–220. Springer, 2001.
R. Alur, T. Henzinger, and O. Kupferman. Alternating-time temporal logic. Journal of the ACM, 49(5):1–42, 2002.
T. Ball and S. Rajamani. Bebop: A symbolic model checker for boolean programs. In Proceedings of the SPIN 2000 Workshop on Model Checking of Software, LNCS 1885, pages 113–130. Springer, 2000.
A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model-checking. In Proc. 8th Conference on Concurrency Theory, volume 1243 of LNCS, pages 135–150, Warsaw, July 1997. Springer.
J. Büchi and L. Landweber. Solving sequential conditions by finite-state strategies. Trans. AMS, 138:295–311, 1969.
T. Cachat. Symbolic strategy synthesis for games on pushdown graphs. In Automata, Languages and Programming, 29th Int’l Coll., ICALP, Malaga, Spain, July 8–13, 2002, Proceedings, volume 2380 of LNCS, pages 704–715. Springer.
A. Chakrabarti, L. de Alfaro, T. Henzinger, M. Jurdzinski, and F. Mang. Interface compatibility checking for software modules. In Proceedings of the 14th Int’l Conf. on Computer-Aided Verification, LNCS 2404, pages 428–441. Springer, 2002.
L. de Alfaro and T. A. Henzinger. Interface automata. In Proceedings of the Ninth Annual Symposium on Foundations of Software Engineering (FSE), pages 109–120. ACM Press, 2001.
E. A. Emerson. Model checking and the mu-calculus. In N. Immerman and P. Kolaitis, editors, Proceedings of the DIMACS Symposium on Descriptive Complexity and Finite Models, pages 185–214. American Mathematical Society Press, 1997.
O. Kupferman and M. Vardi. Church’s problem revisited. The Bulletin of Symbolic Logic, 5(2):245–263, June 1999.
O. Kupferman, M. Vardi, and P. Wolper. Module checking. Information and Computation, 164(2):322–344, 2001.
P. Madhusudan and P. S. Thiagarajan. A decidable class of asynchronous distributed controllers. In Proceedings of the 13th International Conference on Concurrency Theory (CONCUR’ 02), LNCS 2421, pages 145–160. Springer, 2002.
R. McNaughton. Infinite games played on finite graphs. Annals of Pure and Applied Logic, 65:149–184, 1993.
G. Peterson and J. Reif. Multiple-person alternation. In Proc. 20st IEEE Symposium on Foundation of Computer Science, pages 348–363, 1979.
A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proc. 16th ACM Symposium on Principles of Programming Languages, Austin, January 1989.
A. Pnueli and R. Rosner. Distributed reactive systems are hard to synthesize. In Proc. 31st IEEE Symposium on Foundation of Computer Sc., pages 746–757, 1990.
K. Rudie and W. Wonham. Think globally, act locally: Decentralized supervisory control. IEEE Transactions on Automatic Control, 37(11):1692–1708, 1992.
W. Thomas. Languages, automata, and logic. Handbook of Formal Language Theory, III:389–455, 1997.
W. Thomas. Infinite games and verification. In Proceedings of the International Conference on Computer Aided Verification CAV’02, volume 2404 of Lecture Notes in Computer Science, pages 58–64. Springer, 2002.
I. Walukiewicz. Pushdown processes: Games and model-checking. Information and Computation, 164(2):234–263, January 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alur, R., Torre, S.L., Madhusudan, P. (2003). Modular Strategies for Recursive Game Graphs. In: Garavel, H., Hatcliff, J. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2003. Lecture Notes in Computer Science, vol 2619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36577-X_26
Download citation
DOI: https://doi.org/10.1007/3-540-36577-X_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00898-9
Online ISBN: 978-3-540-36577-8
eBook Packages: Springer Book Archive