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
Proceedings ArticleDOI
Infinite horizon safety controller synthesis through disjunctive polyhedral abstract interpretation
TL;DR: This paper presents a controller synthesis approach using disjunctive polyhedral abstract interpretation that synthesizes infinite time-horizon controllers for safety properties with discrete-time, linear plant model and a switching feedback controller that is suitable for time-triggered implementations.
Proceedings ArticleDOI
Decomposition Theorems and Model-Checking for the Modal $\mu$-Calculus
TL;DR: It is shown that the model-checking problem for Lμ is fixed-parameter tractable (fpt) on classes of structures of bounded Kelly-width or bounded DAG-width, which are the first fpt results for L μ which do not follow from embedding into monadic second-order logic.
Journal ArticleDOI
The Complexity of Synthesizing Uniform Strategies
TL;DR: A formal language to specify uniformity properties of strategies, interpreted over two-player turn-based arenas equip ped with a binary relation between plays, to capture e.g. games with winning conditions expressible in epistemic temporal logic.
Book ChapterDOI
Weighted probabilistic equivalence preserves ω -regular properties
TL;DR: This paper provides a structural definition of weighted probabilistic equivalence (WPE), defines the quotient under WPE and proves some elementary properties, including ω-regular properties are preserved when reducing the state space of a DTMC using WPE.
Journal ArticleDOI
Presburger Arithmetic with algebraic scalar multiplications.
TL;DR: It is shown that the complexity of deciding sentences in Presburger arithmetic extended by scalar multiplication by an algebraic irrational number $\alpha$ is substantially harder than in PA.