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
Hybrid Compositional Reasoning for Reactive Synthesis from Finite-Horizon Specifications
TL;DR: This work offers an LTLf to DFA conversion technique that addresses all three necessities, hence resolving the bottleneck, and utilizes both explicit and symbolic representations of the state-space, and effectively leverages their complementary strengths.
Book ChapterDOI
Unique sink orientations of grids
TL;DR: The combinatorial structure of unique sink orientations of grids as digraph models for many well-studied problems, including linear programming over products of simplices and generalized linear complementarity problems over P-matrices (PGLCP), are investigated and randomized algorithms for finding the sink are developed.
Proceedings ArticleDOI
An Improved Recursive Algorithm for Parity Games
Yao Liu,Zhenhua Duan,Cong Tian +2 more
TL;DR: An improved recursive algorithm is presented in this paper for reducing the number of recursive calls in parity games and a conditional statement is inserted before the second recursive call of the existing algorithm where in case the condition is satisfied, the result can be obtained directly without executing the first recursive call.
Informatique Mathématique : une photographie en 2013
Emmanuel Beffara,Jean-Daniel Boissonnat,Sylvie Boldo,Frédéric Chazal,Emeric Gioan,Matthieu Martel,Christophe Paul,Guillaume Melquiond,Jorge Luis Ramírez Alfonsín,Lionel Vaux,Mariette Yvinec +10 more
Book ChapterDOI
Terminal Sequence Induction via Games
TL;DR: Phrased in terms of games, the main technical result is that behavioural equivalence on F -coalgebras for a finitary set functor F can be captured by a two-player graph game in which at every position a player has only finitely many moves.