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
Computing Weakest Strategies for Safety Games of Imperfect Information
Wouter Kuijper,Jaco van de Pol +1 more
TL;DR: This work demonstrates how the richer structure of contravariant antichains for representing antitone functions, as opposed to standard antichain for representing sets of downward closed sets, allows cedar to apply a significantly less complex controllable predecessor step than previous algorithms.
Journal ArticleDOI
Finite-state Strategies in Delay Games
TL;DR: This work presents a very general framework for computing finite-state strategies in delay games: they exist for all winning conditions that are recognized by automata with acceptance conditions that satisfy a certain aggregation property.
Journal ArticleDOI
Limit Your Consumption! Finding Bounds in Average-energy Games
TL;DR: In this article, the authors consider the problem of determining upper bounds on the average accumulated energy or on the capacity while satisfying a given lower bound, i.e., we do not determine whether a given bound is sufficient to meet the specification, but if there exists a sufficient bound to meet it.
Posted Content
On Recognizable Tree Languages Beyond the Borel Hierarchy
Olivier Finkel,Pierre Simonnet +1 more
TL;DR: In this paper, the topological complexity of non Borel recognizable tree languages with regard to the difference hierarchy of analytic sets was investigated, and it was shown that any tree language accepted by an unambiguous Buchi tree automaton must be Borel.
Weak MSO: Automata and Expressiveness Modulo Bisimilarity.
TL;DR: The bisimulation-invariant fragment of weak monadic second-order logic (WMSO) is equivalent to the fragment of the modal μ-calculus where the application of the least fixpoint operator μp is restricted to formulas φ that are continuous in p as discussed by the authors.