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
Journal ArticleDOI
On the design of correct and optimal dynamical systems and games
TL;DR: The structured presentation of design methods is intended to foster their understanding, integration, cross-fertilization and improvement.
Proceedings ArticleDOI
Differential Controller Synthesis at Runtime Using Changed Parts of Environment Model
TL;DR: In this article, the authors propose an efficient algorithm for regenerating a specification that guarantees safety properties under the environment changed at runtime of the system, and evaluated the computational time of their algorithm in two scenarios and found that it was faster than the existing algorithm for generating a specification.
Journal ArticleDOI
Model Checking a Logic for True Concurrency
Paolo Baldan,Tommaso Padoan +1 more
TL;DR: A local model-checking technique based on a tableau system is developed, for which, over a class of event structures satisfying a suitable regularity condition, referred to as strong regularity, it is proved that termination, soundness, and completeness are proved.
Journal ArticleDOI
Safe Environmental Envelopes of Discrete Systems
TL;DR: In this paper , the authors propose a notion of robustness as an explicit, first-class property of a transition system that captures how robust it is against possible deviations in the environment.
Journal ArticleDOI
Stackelberg-Pareto Synthesis (Extended Version)
TL;DR: In this paper , the Stackelberg Pareto synthesis problem is studied in the context of two-player games, where one player announces a strategy and the other player responds rationally with a strategy that is an optimal response.