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
Posted Content
The Complexity of Games on Higher Order Pushdown Automata
Thierry Cachat,Igor Walukiewicz +1 more
TL;DR: An n-EXPTIME lower bound is proved for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n, which matches the known upper bound for parity games on HPDA.
Dissertation
Contribution à l'étude des jeux sur des graphes de processus à pile
TL;DR: In this paper, the authors present a formalisme in which the first joueur, Eve, represents a program which evolue dans un environnement hostile represente by the second joueur, Adam, who represents a game in which Eve possede a strategie gagnante and Adam a determiner.
Journal ArticleDOI
Randomization in Automata on Infinite Trees
TL;DR: Two relaxations of the notion of accepting run are considered, introducing a qualitative aspect, and it is shown that if operation to the Büchi condition is restricted, this leads to a class of probabilistic automata on infinite trees enjoying a decidable emptiness problem.
Journal ArticleDOI
Computable fixpoints in well-structured symbolic model checking
TL;DR: A general finite-time convergence theorem for fixpoint expressions over a well-quasi-ordered set is proved, which has immediate applications for the verification of well-structured systems and game-theoretical properties and probabilistic systems where nesting and alternation of least and greatest fixpoints are common.
Book ChapterDOI
On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems
TL;DR: A general finite convergence theorem for “upward-guarded" fixpoint expressions over a well-quasi-ordered set is proved, which has immediate applications in regular model checking of well-structured systems.