Abstract
Games played on finite graphs were first introduced by McNaughton in [6]. Mc- Naughton, using the ideas of the paper by Gurevich and Harrington [3], proved that winners in his games have finite state winning strategies. Later based on McNaughton games, Nerode, Remmel and Yakhnis in a series of papers (see [7] and [8], for example) developed foundations of concurrent programming by identifying distributed concurrent programs with finite state strategies and studied complexities of finding winners in McNaughton games. Dinneen and Khoussainov use McNaughton games for modelling and studying structural and complexitytheoretical properties of update networks (see [1]). Later in [2] Bodlaender, Dinneen and Khoussainov generalize the study of update networks by introducing the concept of relaxed update network. They proved that it is possible to detect in polynomial time whether or not a given game represents a relaxed update network. In this paper we continue the line of research of the above mentioned work and begin with the following de.nition from [6]:
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
M. J. Dinneen and B. Khoussainov. Update networks and their routing strategies. In Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science, WG2000, volume 1928 of Lecture Notes on Computer Science, pages 127–136. Springer-Verlag, June 2000.
H.L. Bodlaender, M.J. Dinneen and B. Khoussainov. On Game-Theoretic Models of Networks, in Algorithms and Computation (ISAAC 2001 proceedings), LNCS 2223, P. Eades and T. Takaoka (Eds.), p. 550–561, Springer-Verlag Berlin Heidelberg 2001.
Y. Gurevich and L. Harrington. Trees, Automata, and Games, STOCS, 1982, pages 60–65.
J. F. Knight and B. Luense. Control Theory, Modal Logic, and Games, In Hybrid Systems IV. Panos J. Antsaklis, Wolf Kohn, Anil Nerode, Shankar Sastry (Eds.), volume 1273 of Lecture Notes in Computer Science, pages 160–173. Springer, 1997.
D. Martin. Borel Determinacy. Ann. Math. Vol 102, 363–375, 1975.
R. McNaughton. Infiite games played on fiite graphs. Annals of Pure and Applied Logic, 65:149–184, 1993.
A. Nerode, J. Remmel, and A. Yakhnis. McNaughton games and extracting strategies for concurrent programs. Annals of Pure and Applied Logic, 78:203–242, 1996.
A. Nerode, A. Yakhnis, V. Yakhnis. Distributed concurrent programs as strategies in games. Logical methods (Ithaca, NY, 1992), pages 624–653, Progr. Comput. Sci. Appl. Logic, 12, Birkhauser Boston, Boston, MA, 1993.
M. Vardi. An automata-theoretic approach to linear temporal logic. Proceedings of the VIII Ban. Higher Order Workshop. Springer Workshops in Computing Series, Ban., 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ishihara, H., Khoussainov, B. (2002). Complexity of Some Infinite Games Played on Finite Graphs. In: Goos, G., Hartmanis, J., van Leeuwen, J., Kučera, L. (eds) Graph-Theoretic Concepts in Computer Science. WG 2002. Lecture Notes in Computer Science, vol 2573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36379-3_24
Download citation
DOI: https://doi.org/10.1007/3-540-36379-3_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00331-1
Online ISBN: 978-3-540-36379-8
eBook Packages: Springer Book Archive