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
Book ChapterDOI
Partial Solvers for Generalized Parity Games
TL;DR: This paper combines the classical recursive algorithm for parity games due to Zielonka with partial solvers for generalized parity games that are games with conjunction of parity objectives or disjunction of parity objective.
Posted Content
Probabilistic Model Checking for Propositional Projection Temporal Logic
TL;DR: This paper investigates the probabilistic model checking approach for PPTL towards verifying arbitrary linear-time properties, and presents an algorithm to determinize and minimize the nondeterministic NFG_inf following the Safra's construction.
Journal ArticleDOI
On the existence of weak subgame perfect equilibria
TL;DR: This work focuses on the recently introduced notion of weak subgame perfect equilibrium (weak SPE), a variant of the classical notion of SPE, where players who deviate can only use strategies deviating from their initial strategy in a finite number of histories.
Posted Content
Cost Automata, Safe Schemes, and Downward Closures
TL;DR: This work proves, under a syntactical constraint called safety, decidability of the model-checking problem for recursion schemes against properties defined by alternating B-automata, an extension of alternating parity automata for infinite trees with a boundedness acceptance condition, and exploits this result to show how to compute downward closures of languages of finite trees recognized by safe recursions schemes.
Journal ArticleDOI
Parikh Automata on Infinite Words
TL;DR: In this paper , the authors introduce several variants of Parikh automata on infinite words and study their expressiveness, showing that one of them is equivalent to synchronous blind counter machines introduced by Fernau and Stiebe.