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
Robust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games
TL;DR: This paper provides a robustly exponential worst case for the McNaughton-Zielonka divide et impera algorithm, showing that no intertwining of the above mentioned techniques can help mitigating the exponential nature of the divide et Impera approaches.
Proceedings ArticleDOI
Model Checking Nash Equilibria in MAD Distributed Systems
TL;DR: A symbolic model checking algorithm for verification of Nash equilibria in finite state mechanisms modeling multiple administrative domains (MAD) distributed systems and results are presented showing its effectiveness for moderate size mechanisms.
Proceedings ArticleDOI
A Compositional Approach to Reactive Games under Temporal Logic Specifications
Abhishek Ninad Kulkarni,Jie Fu +1 more
TL;DR: This paper uses the notion of randomized permissive strategy to reduce the strategy synthesis problem to that of identifying only the winning region for the controlled agent against the uncontrolled environment, and exploits the inherent compositional nature of LTL formulas to compose the independently computed winning regions of two sub-games into a superset of the composed-game winning region.
Proceedings Article
A Planning Graph Heuristic for Forward-Chaining Adversarial Planning
Pascal Bercher,Robert Mattmüller +1 more
TL;DR: A forwardchaining approach to adversarial planning based on the AO* algorithm is investigated, and results suggest that in certain planning domains, this approach yields results competitive with the state of the art.
DissertationDOI
A uniform approach to the complexity and analysis of succinct systems
TL;DR: The thesis demonstrates that many well-known modeling formalisms such as communicating state machines, linear-time temporal logic, or timed automata exhibit an immediate connection to this machine model, and develops a new model checking-based algorithm to efficiently find feasible template instantiations.