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
Dissertation
Simulation product fidelity : a qualitative & quantitative system engineering approach
TL;DR: A proposition for the unified design and implementation of modeling abstractions consistent with the simulation objectives based on the computer science, control and system engineering concepts is presented and challenges in research and implementation especially in an industrial context are discussed.
Posted Content
Small witnesses, accepting lassos and winning strategies in omega-automata and games
TL;DR: The known hardness results are surveyed and the complexity landscape for the cases not considered in the literature so far is complete, with particular attention to the approximation hardness of the problems as approximate small solutions usually suffice in practice.
Book ChapterDOI
Model checking linear coalgebraic temporal logics: an automata-theoretic approach
TL;DR: This paper considers linear coalgebraic temporal logics interpreted over nondeterministic coalgebras, and shows how to reduce the model checking problem for such logics to the problem of deciding the winner in a regular two-player game.
Proceedings ArticleDOI
Simple Algorithm for Simple Timed Games
TL;DR: It is shown that the existence of such strategies in the form of Simple Temporal Networks with Uncertainty (STNU) is an NP-complete problem, and a practical consequence is a fully forward algorithm for building STNU strategies.
Book ChapterDOI
Church synthesis problem with parameters
TL;DR: It is shown that the Church synthesis problem for P is computable if and only if the monadic theory of $\langle{Nat,<,P}\rangle$ is decidable and the Buchi-Landweber theorem can be extended only to ultimately periodic parameters.