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
Dynamic Consistency of Conditional Simple Temporal Networks via Mean Payoff Games: A Singly-Exponential Time DC-checking
Carlo Comin,Romeo Rizzi +1 more
TL;DR: A refined notion of dynamic-consistency is introduced, named ε-dynamic-consistent, and a sharp lower bounding analysis on the critical value of the reaction time is presented, applicable more generally when dealing with linear difference constraints which include strict inequalities.
Book ChapterDOI
Fair Termination for Parameterized Probabilistic Concurrent Systems
TL;DR: The encoding reduces termination with finitary fairness to verifying parameterized termination without fairness over probabilistic systems in regular model checking (for which a verification framework already exists), and shows that the algorithm is the first fully-automatic method that can prove termination for many interesting examples from distributed algorithms and evolutionary biology.
Book ChapterDOI
A game approach to determinize timed automata
TL;DR: In this article, a game-based deterministic timed automata determinization algorithm is proposed, which is at once more general than the determinization procedure of [4] and more precise than the approximation algorithm of [11].
Posted Content
Mean-Payoff Pushdown Games
TL;DR: In this paper, the authors considered pushdown games with mean-payoff objectives and showed that the problem is NP-hard under global strategies and undecidable under modular strategies.
Assured and Correct Dynamic Update of Controllers
Leandro Nahabedian,Victor Braberman,N. D'Ippolitto,Shinichi Honiden,Jeff Kramer,Kenji Tei,Sebastian Uchitel +6 more
TL;DR: This paper presents a general approach to specifying correctness criteria for dynamic update and a technique for automatically computing a controller that handles the transition from the old to the new specification, assuring that the system will reach a state in which such a transition can correctly occur.