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
On the expressiveness of refinement settings
TL;DR: The paper’s main result is an expressiveness hierarchy, as well as language-preserving transformations between various settings, which helps tool builders who wish to reuse refinement checkers or model checkers across different settings.
Book ChapterDOI
An invitation to play
TL;DR: Parity games and their subclasses and variants pop up in various contexts: μ-calculus, tree automata, program verification, and so on.
Journal ArticleDOI
Symbolic Planning and Control Using Game Theory and Grammatical Inference
TL;DR: In this paper, a deterministic two-player zero-sum game with a factored, modular representation is proposed to describe the purposeful interaction of a system with its unknown environment, where the strategy synthesized based on the learned hypothesis converges in finite time.
Posted Content
Monadic second order logic as the model companion of temporal logic
TL;DR: The main focus of as mentioned in this paper is on bisimulation-invariant MSO on trees, and more particularly on giving a novel model-theoretic approach to it.
Posted ContentDOI
The Strahler number of a parity game
TL;DR: It is proved that parity games can be solved in quasi-linear space and in time that is polynomial in the number of vertices~$n$ and linear in $({d/{2k})^k$, where $k$ is the Strahler number.