A Landscape with Games in the Background

Authors:
Igor Walukiewicz
Affiliations:
Université Bordeaux-1 and CNRS, France
Venue:
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Year:
2004

Citing 0
Cited 15

Synthesis of distributed systems from knowledge-based specifications

CONCUR 2005 - Concurrency Theory
Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Positional Strategies for Higher-Order Pushdown Parity Games

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
On the expressiveness and complexity of ATL

FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Admissibility in infinite games

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Memory reduction for strategies in infinite games

CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Information Tracking in Games on Graphs

Journal of Logic, Language and Information
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
Model-checking games for fixpoint logics with partial order models

Information and Computation
Concurrent logic games on partial orders

WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Qualitative reachability in stochastic BPA games

Information and Computation
Parity games played on transition graphs of one-counter processes

FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
A survey of stochastic ω-regular games

Journal of Computer and System Sciences
Visibly pushdown games

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Continuous-time stochastic games with time-bounded reachability

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

An overview of applications of two player path-forming games to verification and synthesis is given. Several extensions of the standard model of finite games with regular winning conditions are discussed. One direction is that of considering non-regular winning conditions. The other concerns the ways games are played, in particular probabilistic and multi-player games.