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
Strategy machines and their complexity
TL;DR: A machine model for the execution of strategies in (regular) infinite games that refines the standard model of Mealy automata is introduced and this model of controllers is formalized in the terminological framework of Turing machines.
Journal ArticleDOI
GUIDE: Games with UML for interactive design exploration
Jennifer Tenzer,Perdita Stevens +1 more
TL;DR: The design tool GUIDE is presented, which allows the user to explore a design in UML interactively by playing a game that incorporates both the design model and a specification of what it means for the design to be correct.
Journal ArticleDOI
Down the Borel Hierarchy: Solving Muller Games via Safety Games
TL;DR: This work transforms a Muller game with n vertices into a safety game with (n!)^3 vertices whose solution allows to determine the winning regions of the Muller game and to compute a finite-state winning strategy for one player.
Journal ArticleDOI
Regular Language Representations in the Constructive Type Theory of Coq
Christian Doczkal,Gert Smolka +1 more
TL;DR: This work explores the theory of regular language representations in the constructive type theory of Coq with results including a constructive decidability proof for the logic WS1S, a constructive refinement of the Myhill-Nerode characterization of regularity, and translations from two- way automata to one-way automata with verified upper bounds for the increase in size.
Posted Content
A Decidable Fragment of Strategy Logic
TL;DR: One-Goal Strategy Logic is introduced and it is proved that, unlike SL, it has the bounded tree-model property and its satisfiability problem is decidable in 2ExpTime, thus not harder than the one for ATL*.