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
Explorable Automata
Emile Hazard,Denis Kuperberg +1 more
TL;DR: It is shown that recognizing GFG automata among explorable ones is in PTime , thereby giving a strong link between the two notions, and ω -explorable automata form a non-trivial class even for the safety acceptance condition (but not for reachability), and give.
Proceedings ArticleDOI
A Lattice-Theoretical View of Strategy Iteration
TL;DR: In this paper , a general formalisation of strategy iteration for solving least point equations over a suitable class of complete lattices, based on MV-chains, has been proposed, which can be used for non-expansive point functions represented as min- respectively max-decompositions.
Posted Content
Simulation-Checking of Real-Time Systems with Fairness Assumptions
TL;DR: This work investigates the simulation problem in of dense-time system and proposes a simulation-checking algorithm for a subclass of the problem with at most one fairness assumption for the specification, and presents efficient techniques to take the common environment into consideration.