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
Tree automata make ordinal theory easy
TL;DR: In this article, a new simple proof of the decidability of the First Order Theory of (ϵ, ϵ) and the Monadic Second Order theory of (ωi, <) was given.
Journal ArticleDOI
Careful Autonomous Agents in Environments With Multiple Common Resources
TL;DR: In this paper , the problem of careful rational synthesis with bounded resources is studied, motivated by the observation that in practical settings, the storage of resources is limited, and it is shown that the problem becomes decidable.
Posted Content
Characterization theorems for PDL and FO(TC)
TL;DR: It is shown that PDL is expressively equivalent to the bisimulation-invariant fragment of both $\mathrm{FO(TC^1)}$ and WCL (weak chain logic) and the main contributions can be divided in three parts: fixpoint extensions of first-order logic, automata and expressiveness on trees, and Automata and drive automata.
On Minimization and Learning of Deterministic $\omega$-Automata in the Presence of Don't Care Words
C. Loding,M. Stachon +1 more
TL;DR: In this article , it was shown that the number of priorities in deterministic parity automata can be efficiently minimized under an arbitrary set of don't care words with trivial right congruence.
Posted Content
Nash Equilibria in Finite-Horizon Multiagent Concurrent Games
TL;DR: In this article, a combination of safety games and lasso testing in Buchi automata is used to check for and find pure strategy Nash equilibria in multiagent concurrent games with finite-horizon temporal goals.