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
Comparator Automata in Quantitative Verification
TL;DR: In this paper, the authors identify a novel mode of comparison in quantitative systems: the online comparison of the aggregate values of two sequences of quantitative weights, and introduce comparator automata, a new class of automata that read two infinite sequences of weights synchronously and relate their aggregate values.
Proceedings ArticleDOI
Generalized Data Automata and Fixpoint Logic
Thomas Colcombet,Amaldev Manuel +1 more
TL;DR: The fragment which is defined by limiting the number of alternations between future and past formulas is shown to be decidable, by first converting the formulas to equivalent alternating Buchi automata and then to Buchi GDA.
Journal Article
On the relationship between monadic and weak monadic second order logic on arbitrary trees, with applications to the mu-calculus
David Janin,Giacomo Lenzi +1 more
TL;DR: This paper shows that the bisimulation invariant fragment of the monadic Σ 2 level of the quantifier alternation depth hierarchy of monadic second order logic (MSO) equals the vµ-level of the mu-calculus hierarchy.
Journal ArticleDOI
Hybrid Compositional Reasoning for Reactive Synthesis from Finite-Horizon Specifications
TL;DR: In this article, a hybrid representation approach for the conversion of LTLF to DFA is proposed, which utilizes both explicit and symbolic representations of the state-space, and effectively leverages their complementary strengths.
Proceedings ArticleDOI
Inherent vacuity for GR(1) specifications
Shahar Maoz,Rafi Shalom +1 more
TL;DR: This work defines several general types of inherent vacuity for GR(1), including specification element vacuity and domain value vacuity, and defines a novel notion of vacuity core, which provides means to localize the cause of Vacuity.