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
Pareto-Rational Verification
TL;DR: The model of rationality in which the environment only executes behaviors that are Pareto-optimal with regard to its set of objectives is considered, given the behavior of the system (which is committed in advance of any interaction).
Posted ContentDOI
Scalar and Vectorial mu-calculus with Atoms
Bartek Klin,Mateusz Łełyk +1 more
TL;DR: An extension of modal $\mu$-calculus to sets with atoms is studied and model checking is decidable on orbit-finite structures, and a correspondence to parity games holds.
Journal ArticleDOI
CEGAR for compositional analysis of qualitative properties in Markov decision processes
TL;DR: This work introduces a new simulation relation to capture the refinement relation of MDPs with respect to qualitative properties, and presents discrete graph algorithms with quadratic complexity to compute the simulation relation.
Book ChapterDOI
On model checking techniques for randomized distributed systems
TL;DR: The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision process and a formalization of the desired event E by an ω-regular linear-time property.
Posted Content
Completeness of Kozen's Axiomatization for the Modal mu-Calculus: A Simple Proof.
TL;DR: An improved proof for the completeness of Koz is presented which, although similar to the original, is simpler and easier to understand.