The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Languages, automata, and logic
Handbook of formal languages, vol. 3
Deciding the winner in parity games is in UP ∩ co-UP
Information Processing Letters
Pushdown processes: games and model-checking
Information and Computation - Special issue on FLOC '96
Modal and temporal properties of processes
Modal and temporal properties of processes
Distributed Controller Synthesis for Local Specifications
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
As Soon as Possible: Time Optimal Control for Timed Automata
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
A Discrete Strategy Improvement Algorithm for Solving Parity Games
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
On Model-Checking for Fragments of µ-Calculus
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
How much memory is needed to win infinite games?
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Distributed reactive systems are hard to synthesize
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Synthesis of interface specifications for Java classes
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Modular strategies for recursive game graphs
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
Games with winning conditions of high Borel complexity
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
Synthesis of Open Reactive Systems from Scenario-Based Specifications
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'03)
On Effective Methods for Diagnosis of Retaining Faults in Circuits
Fundamenta Informaticae
On the Controller Synthesis for Finite-State Markov Decision Processes
Fundamenta Informaticae
Dealing with Nondeterminism in Symbolic Control
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Model Checking: From Tools to Theory
25 Years of Model Checking
Positional Strategies for Higher-Order Pushdown Parity Games
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Complexity results in revising UNITY programs
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Model checking nash equilibria in MAD distributed systems
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
GUIDE: Games with UML for Interactive Design Exploration
Proceedings of the 2005 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the fourth SoMeT_W05
Measuring Permissivity in Finite Games
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Symbolic synthesis of finite-state controllers for request-response specifications
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Admissibility in infinite games
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Modular strategies for recursive game graphs
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Memory reduction for strategies in infinite games
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Reachability games on extended vector addition systems with states
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Computing equilibria in two-player timed games via turn-based finite games
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Nash equilibria for reachability objectives in multi-player timed games
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Perfect-Information Games with Lower-Semicontinuous Payoffs
Mathematics of Operations Research
Reachability games on automatic graphs
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Qualitative reachability in stochastic BPA games
Information and Computation
Extracting winning strategies in update games
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Measuring permissiveness in parity games: mean-payoff parity games revisited
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Feasibility of Stepwise Design of Multitolerant Programs
ACM Transactions on Software Engineering and Methodology (TOSEM)
On the markovian randomized strategy of controller for markov decision processes
FSKD'06 Proceedings of the Third international conference on Fuzzy Systems and Knowledge Discovery
Composition of services with nondeterministic observable behavior
ICSOC'05 Proceedings of the Third international conference on Service-Oriented Computing
On the controller synthesis for finite-state markov decision processes
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Borel ranks and wadge degrees of context free ω-languages
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Formal Methods in System Design
Concurrent games with ordered objectives
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Efficient Algorithms for Games Played on Trees with Back-edges
Fundamenta Informaticae
On the Controller Synthesis for Finite-State Markov Decision Processes
Fundamenta Informaticae
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
On Winning Conditions of High Borel Complexity in Pushdown Games
Fundamenta Informaticae
Synthesis of Open Reactive Systems from Scenario-Based Specifications
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'03)
A Lightweight Method for Automated Design of Convergence in Network Protocols
ACM Transactions on Autonomous and Adaptive Systems (TAAS) - Special Section: Extended Version of SASO 2011 Best Paper
Action-based discovery of satisfying subsets: A distributed method for model correction
Information and Software Technology
Continuous-time stochastic games with time-bounded reachability
Information and Computation
Behavioural description based web service composition using abstraction and refinement
International Journal of Web and Grid Services
Solving infinite games on trees with back-edges
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
| Hi-index | 0.00 |
The purpose of this tutorial is to survey the essentials of the algorithmic theory of infinite games, its role in automatic program synthesis and verification, and some challenges of current research.