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
Efficient reactive controller synthesis for a fragment of linear temporal logic
TL;DR: A fragment of linear temporal logic is introduced that can be used to specify common motion planning tasks such as safe navigation, response to the environment, persistent coverage, and surveillance.
Posted Content
MDP Optimal Control under Temporal Logic Constraints
TL;DR: A sufficient condition for a policy to be optimal is proposed, and a dynamic programming algorithm is developed that synthesizes a policy that is optimal under some conditions, and sub-optimal otherwise.
Book ChapterDOI
Unsafe grammars and panic automata
TL;DR: The problem of checking if an infinite tree generated by a higher-order grammar of level 2 (hyperalgebraic) satisfies a given μ-calculus formula (or, equivalently, if it is accepted by an alternating parity automaton) is decidable, actually 2-Exptime-complete.
Book ChapterDOI
Datalog and constraint satisfaction with infinite templates
Manuel Bodirsky,Víctor Dalmau +1 more
TL;DR: It is proved that every non-empty problem that is closed under disjoint unions and has Datalog width one can be formulated as a constraint satisfaction problem (CSP) with a countable template that is ω-categorical.
Automata: from logics to algorithms.
Moshe Y. Vardi,Thomas Wilke +1 more
TL;DR: Translations from five different logics are reviewed, in a unified framework, into appropriate models of finite-state automata on infinite words or infinite trees, and optimal complexity bounds for satisfiability, conformance, and realizability are obtained for all logics.