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
Book ChapterDOI
Rational synthesis
TL;DR: A method is provided for solving the rational-synthesis problem, and it is shown that for the classical definitions of equilibria studied in game theory, rational synthesis is not harder than traditional synthesis.
Book ChapterDOI
Reasoning About Strategies
TL;DR: It is proved that Sl strictly includes CHP-Sl, while maintaining a decidable model-checking problem, and it is shown that it is 2ExpTime-complete under a reasonable semantics, thus not harder than that for Atl \(^{*}\) and a remarkable improvement of the same problem for CHp-Sl.
Journal ArticleDOI
Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
TL;DR: It is shown that delayed simulation---unlike fair simulation---preserves the automaton language upon quotienting and allows substantially better state space reduction than direct simulation.
Proceedings Article
Synthesis for LTL and LDL on finite traces
TL;DR: This paper describes the problem computationally as 2EXPTIME-complete and presents a sound and complete synthesis technique based on DFA (reachability) games.
Journal ArticleDOI
Energy parity games
TL;DR: In this paper, it was shown that exponential memory is sufficient and may be necessary for winning strategies in energy parity games, and that the problem of deciding the winner in such games can be solved in polynomial time in NP? coNP.