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
Journal ArticleDOI
Synthesis from component libraries
Yoad Lustig,Moshe Y. Vardi +1 more
TL;DR: This work defines and study the problem of LTL synthesis from libraries of reusable components, and defines two notions of composition: data-flow composition, for which it is proved the problem is undecidable, and control- flow composition, which is proved to be 2EXPTIME-complete.
Book ChapterDOI
A subexponential lower bound for Zadeh's pivoting rule for solving linear programs and games
TL;DR: The first subexponential lower bound of the form 2Ω(√n) lower bound is obtained by utilizing connections between pivoting steps performed by simplex-based algorithms and improving switches performed by policy iteration algorithms for 1-player and 2-player games.
Journal ArticleDOI
Automata and fixed point logic: a coalgebraic perspective
TL;DR: In this article, the authors generalize existing connections between automata and logic to a coalgebraic abstraction level, and introduce various notions of F-automata, devices that operate on pointed F-coalgebras.
Proceedings ArticleDOI
Hope for the best, prepare for the worst: multi-tier control for adaptive systems
TL;DR: This paper introduces a rigorous, tiered framework for combining behaviour models, each with different associated assumptions and risks, used to generate operational strategies, which are then executed concurrently at runtime.
Book ChapterDOI
Higher order pushdown automata, the Caucal hierarchy of graphs and parity games
TL;DR: This work considers two-player parity games played on transition graphs of higher order pushdown automata and shows how to reduce a game to a graph of lower level, leading to an effective solution and a construction of the winning strategies.