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
Les jeux d’accessibilité généralisée
Nathanaël Fijalkow,Florian Horn +1 more
TL;DR: It is proved that deciding the winner in two-player zero-sum games with generalized reachabi lity objectives, defined as conjunctions of reachability objectives, is PSPACE -complete, although it is fixed-parameter tractable with the number of reachable objectives as parameter.
Proceedings ArticleDOI
Games for Active XML Revisited.
TL;DR: In this article, the safe rewriting problem in active context-free games is studied, where the goal is to decide whether the first player, Juliet, has a winning strategy for a given game and (nested) word.
Book ChapterDOI
Parameterized Algorithms for Parity Games
TL;DR: Determining the winner of a Parity Game is a major problem in computational complexity with a number of applications in verification, and the problem has often been considered with parameters such as treewidth or clique-width, by applying dynamic programming techniques.
Journal ArticleDOI
Experimental Aspects of Synthesis
TL;DR: Why previous tools have incompatible scopes and semantics is explained and a framework that reduces the impact of this problem for future experimental comparisons of such tools is provided.
Book ChapterDOI
Abstraction of Graph Transformation Systems by Temporal Logic and Its Verification
TL;DR: This work introduced abstraction of heap structures using regular expressions mainly for verifying concurrent garbage collection algorithms and studied abstraction of several kinds of link structures, which are instances of graph transformation systems.