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
Pure and Applied Fixed−Point Logics
TL;DR: It is shown that in the context of modal logic, inflationary fixed points are far more expressive than least fixed points, and already relatively simple logics such as the transitive closure logic lead to undecidable query languages on constraint databases.
Proceedings ArticleDOI
Formal methods for adaptive control of dynamical systems
Sadra Sadraddini,Calin Belta +1 more
TL;DR: In this article, a method to control discrete-time systems with constant but initially unknown parameters from linear temporal logic (LTL) specifications is developed, which is correct-by-design and does not require a reference model.
Posted Content
Algorithms for Synthesizing Priorities in Component-based Systems
Chih-Hong Cheng,Saddek Bensalem,Yu-Fang Chen,Rongjie Yan,Barbara Jobstmann,Harald Ruess,Christian Buckl,Alois Knoll +7 more
TL;DR: This work proposes three complementary methods as preprocessing steps for priority synthesis, namely data abstraction to reduce component complexities, alphabet abstraction and #-deadlock to ignore components, and automated assumption learning for compositional priority synthesis.
Book ChapterDOI
Improving Parity Game Solvers with Justifications.
TL;DR: This paper improves several parity game solvers by using a justification graph, and experimental evaluation shows the algorithms improve upon the state-of-the-art.
Proceedings Article
PDL Inside the μ-calculus: A Syntactic and an Automata-theoretic Characterization
Facundo Carreiro,Yde Venema +1 more
TL;DR: This paper provides an exact syntactic characterization of the fragments of the μ-calculus that correspond to PDL and to test-free PDL, which shed light on the relation between these logics and the modal μ-Calculus and provide a new framework for the development of the theory of PDL.