Open AccessBook
Automata logics, and infinite games: a guide to current research
Reads0
Chats0
TLDR
The 19 chapters presented in this multi-author monograph give a consolidated overview of the research results achieved in the theory of automata, logics, and infinite games during the past 10 years.Abstract:
A central aim and ever-lasting dream of computer science is to put the development of hardware and software systems on a mathematical basis which is both firm and practical. Such a scientific foundation is needed especially for the construction of reactive programs, like communication protocols or control systems.
For the construction and analysis of reactive systems an elegant and powerful theory has been developed based on automata theory, logical systems for the specification of nonterminating behavior, and infinite two-person games.
The 19 chapters presented in this multi-author monograph give a consolidated overview of the research results achieved in the theory of automata, logics, and infinite games during the past 10 years. Special emphasis is placed on coherent style, complete coverage of all relevant topics, motivation, examples, justification of constructions, and exercises.read more
Citations
More filters
Journal ArticleDOI
On Recognizable Tree Languages Beyond the Borel Hierarchy
Olivier Finkel,Pierre Simonnet +1 more
TL;DR: The topological complexity of non Borel recognizable tree languages with regard to the difference hierarchy of analytic sets is investigated and it is proved that the D$_{ω^n}$(Σ$^1_1$)-complete tree languages L$_n$ are Wadge reducible to the game tree language W$(i,κ)}$ for κ−ig 2.
Journal ArticleDOI
Polynomial-Time Under-Approximation of Winning Regions in Parity Games
TL;DR: A pattern for designing algorithms that run in polynomial time by construction and under-approximate the winning regions of both players in parity games by the interaction of finitely many aspects governed by a common ranking function.
Book ChapterDOI
Qualitative Concurrent Stochastic Games with Imperfect Information
Vincent Gripon,Olivier Serre +1 more
TL;DR: In this article, the authors study a model of games that combines concurrency, imperfect information and stochastic aspects, and prove that the following problem is complete for 2-exponential time: decide whether the first player has a strategy that ensures her to almost-surely win against any possible strategy of her opponent.
Constructive semantics for instantaneous reactions.
Joaquin Aguado,Michael Mendler +1 more
TL;DR: A general theory for obtaining different notions of constructive responses in terms of winning conditions for finite and infinite games and their characterisation as maximal post-fixed points of functions in directed complete lattices of intensional truth-values is sketched.
Posted Content
Symbolic Planning and Control Using Game Theory and Grammatical Inference
TL;DR: A system can accomplish an objective specified in temporal logic while interacting with an unknown, dynamic but rule-governed environment, by employing grammatical inference and adapting its plan of action on-line to satisfy the task specification.