Wolfgang Thomas  Home/Search
Context Related
Links: DBLP | informatik.unikiel.de/...stacs95.ps.gz informatik.unikiel.de/...stacs95.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: informatik.unikie...publications (more) From: informatik.unikie...publications Homepages: W.Thomas |
Rate this article:      (best)Comment on this article |
Abstract: . Infinite two-person games are a natural framework for the study of reactive nonterminating programs. The effective construction of winning strategies in such games is an approach to the synthesis of reactive programs. We describe the automata theoretic setting of infinite games (given by "game graphs"), outline a new construction of winning strategies in finite-state games, and formulate some questions which arise for games over effectively presented infinite graphs. 1 Introduction One of the ... (Update)
Cited by: More
Symbolic Synthesis of Finite-State Controllers for.. - Wallmeier, Hütten.. (Correct)
Synthesis of Reo Circuits for Implementation of.. - Arbab, Baier, de.. (2005) (Correct)
Timed Games With Branching-Time Winning Conditions - Aniello Murano Dipartimento (Correct)
Active bibliography (related documents): More All
1.7: Languages, Automata, and Logic - Thomas (1996) (Correct)
0.5: Games for the µ-Calculus - Niwinski, Walukiewicz (Correct)
0.5: Singleton Acceptance Conditions in -Automata - Leoniuk, Lescow, Thomas (1998) (Correct)
Similar documents based on text: More All
0.0: Approaches to the Formal Verification of Hybrid Systems - Kowalewski, Herrmann.. (2000) (Correct)
0.0: Finite-State Models for Lexical Reordering in Spoken.. - Bangalore, Riccardi (2000) (Correct)
0.0: A Source Detection Method for ROSAT/PSPC X-Ray.. - Damiani, Maggio.. (Correct)
Related documents from co-citation: More All
28: Infinite games played on finite graphs (context) - McNaughton - 1993
22: Solving sequential conditions by finite-state strategies (context) - Buchi, Landweber - 1969
22: Automata on infinite objects (context) - Thomas - 1990
BibTeX entry: (Update)
W. Thomas, "On the synthesis of strategies in infinite games," in Proceedings of STACS 95, Volume 900 of LNCS (E. W. Mayr and C. Puech, eds.), pp. 1--13, Munich: Springer Verlag, 1995. http://citeseer.ist.psu.edu/thomas95synthesis.html More
@inproceedings{ thomas95synthesis,
author = "Wolfgang Thomas",
title = "On the Synthesis of Strategies in Infinite Games",
booktitle = "Symposium on Theoretical Aspects of Computer Science",
pages = "1-13",
year = "1995",
url = "citeseer.ist.psu.edu/thomas95synthesis.html" }
Citations (may not include all citations):374 Automata on infinite objects (context) - Thomas - 1990 ACM DBLP
308 The control of discrete event systems (context) - Ramadge, Wonham - 1989
176 a decision method in restricted second order arithmetic (context) - Buchi - 1962
114 Fundamental properties of infinite trees (context) - Courcelle - 1983
110 the synthesis of a reactive module (context) - Pnueli, Rosner
103 the synthesis of discrete controllers for timed systems (context) - Maler, Pnueli et al.
102 Verification tools for finite-state concurrent systems - Clarke, Grumberg et al. - 1994
100 Mu-calculus and determinacy (context) - Emerson, Jutla et al. - 1991
51 Descriptive Set Theory (context) - Moschovakis - 1980
49 Solving sequential conditions by finite-state strategies (context) - Buchi, Landweber - 1969
46 Infinite games played on finite graphs (context) - McNaughton - 1993 DBLP
42 Automata on infinite objects and Church's Problem (context) - Rabin - 1972 ACM
42 and games (context) - Gurevich, Harrington et al. - 1982
38 Realizable and unrealizable specifications of reactive syste.. (context) - Abadi, Lamport et al. - 1989 ACM DBLP
34 Borel determinacy (context) - Martin - 1975
34 Regular expressions for infinite trees and a standard form o.. (context) - Mostowski - 1984
31 Games with forbidden positions (context) - Mostowski - 1991
30 Simulating alternating tree automata by nondeterministic aut.. (context) - Muller, Schupp
18 and second-order logic (context) - Muller, Schupp et al. - 1985
15 Concurrent programs as strategies in games (context) - Nerode, Yakhnis et al. - 1992
13 State-strategies for games in F oeffi (context) - Buchi - 1983
9 and a subset construction for tree automata (context) - Klarlund, measures et al. - 1994
8 Hierarchies of weak automata and weak monadic formulas (context) - Mostowski - 1991 ACM DBLP
5 The Temporal Logic of Reactive and Concurrent Programs (context) - Manna, Pnueli - 1992
5 Extension of Gurevich-Harrington's restricted memory determi.. (context) - Yakhnis, Yakhnis - 1990 DBLP
4 Chain automata (context) - Carton - 1994 ACM DBLP
4 Using determinacy to eliminate quantifiers (context) - Buchi - 1977
4 Modelling hybrid systems as games (context) - Nerode, Yakhnis et al.
2 The monadic second-order theory of graphs IX: Machines and t.. (context) - Courcelle - 1994
2 Games on infinite trees and automata with dead-ends (context) - Muchnik - 1992
1 273-283 (context) - Zeitman, determinacy et al. - 1994
1 Doctoral Thesis (context) - Seibert
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.informatik.uni-kiel.de/inf/Thomas/publications.html): More
Omega - System Report - Ackermann, Thomas, Ulbrand, Vöge (1997) (Correct)
An Algorithmic Approach for Checking Closure Properties of .. - Peled, Wilke, Wolper (1998) (Correct)
Singleton Acceptance Conditions in -Automata - Leoniuk, Lescow, Thomas (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC