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
Alternating Reachability Games with Behavioral and Revenue Objectives
Orna Kupferman,Tami Tamir +1 more
TL;DR: This model is the first to combine behavioral and revenue objectives in a multi-player game played on a directed graph, distinguishing between various network topologies and various levels of overlap among the reachability objectives of the players.
Proceedings Article
Tree Automata Make Ordinal Theory Easy
TL;DR: In this paper, the decidability of the First Order Theory and the Monadic Second Order Theory was shown to be decidable under tree automata and a new representation of ordinals by (infinite) trees.
Journal ArticleDOI
Multi-Agent Systems with Quantitative Satisficing Goals
TL;DR: In this article , the authors consider satisficing goals, derived from a decision-making approach aimed at meeting a good enough outcome instead of pure optimization, and employ efficient automata-based algorithms to find pure-strategy Nash equilibria.
Journal ArticleDOI
On Strategies in Synthesis Over Finite Traces
TL;DR: In this paper , it was shown that model checking of non-terminating transducers is exponentially harder than that of terminating transducers, and that the problems are EXPSPACE-complete and PSPACEcomplete, respectively.