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
Posted Content
Decidability Results for Multi-objective Stochastic Games
Romain Brenguier,Vojtěch Forejt +1 more
TL;DR: In this article, it was shown that the problem of deciding whether a player can ensure satisfaction of the objectives with given thresholds is decidable for stochastic two-player turn-based games with finite horizon objectives.
Dissertation
Finitary Logics for Coalgebras with Branching
TL;DR: This dissertation furthers previous work on coalgebras as infinite statebased transition systems and their logical characterisation with particular focus on infinite regular behaviour and branching, and proves that coalgebra automata are closed under complementation in Chapter 10.
Book ChapterDOI
Reasoning about Co-Büchi tree automata
TL;DR: In this paper, a characterization of the class of languages whose complement is accepted by generalized co-Buchi tree automata is given, along with an algorithm for checking the emptiness that takes time linear in the product of the number of states and sets in the acceptance condition.
Posted Content
From $\mu$-Calculus to Alternating Tree Automata using Parity Games
TL;DR: In this paper, an automaton model specially tailored for working with modal $\mu$-calculus is presented, which can deal with arbitrary branching in a much simpler way as compare to the one proposed by Janin and Walukiewicz.
Posted Content
One-to-Two-Player Lifting for Mildly Growing Memory.
TL;DR: In this paper, it was shown that if the memory grows just a bit slower (in the one-player games) than in the example of Bouyer et al., then in every two-player game it is sufficient to have finite memory.