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
Omega-regular half-positional winning conditions
TL;DR: In this paper, the authors study infinite games where one of the players always has a positional (memory-less) winning strategy, while the other player may use a history-dependent strategy, and investigate winning conditions which guarantee such a property for all arenas, or all finite arenas.
Book ChapterDOI
Subgame perfection for equilibria in quantitative reachability games
TL;DR: A refinement of Nash equilibrium well-suited in the framework of games played on graphs is introduced, and the existence of subgame perfect secure equilibria is proved in multiplayer (resp. two-player) quantitative reachability games.
Journal ArticleDOI
Constructive semantics for instantaneous reactions
Joaquin Aguado,Michael Mendler +1 more
TL;DR: In this article, a game-theoretic account of the constructive semantics of step responses for synchronous languages is presented, providing a coherent semantic framework encompassing both non-deterministic Statecharts (as per Pnueli & Shalev) and deterministic esterel.
Proceedings ArticleDOI
Database Encryption and Confirmation Mechanism Research
TL;DR: Based on the connection sub-key production algorithm as well as based on the user information key management technology and the field record confirmation technology, guarantees the database the security.
Proceedings ArticleDOI
On the Expressivity of RoCTL
TL;DR: It is shown that RoCTL* is relatively succinct as all satisfaction preserving translations into CTL* are non-elementary in length, and the equivalence of LTL to counter-free automata is used to show it is expressively equivalent to C TL*.