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
Equilibria in quantitative reachability games
TL;DR: It is proved existence of finite-memory Nash (resp. secure) equilibria in multiplayer games played on finite graphs with reachability objectives.
Journal Article
Knowledge Base Exchange.
TL;DR: A general framework of KB exchange is defined, and the problem of translating the knowledge in the source KB according to the mappings expressed in OWLź2źQL, the profile of the standard Web Ontology Language OWL 2 based on the description logic DL-Lite R is studied.
Book ChapterDOI
Quantitative Analysis under Fairness Constraints
TL;DR: A polynomially time-bounded algorithm is presented for the quantitative analysis of an MDP against *** -automata specifications under fair worst- or best-case scenarios and general notions of strong and weak fairness constraints for Markov decision processes are studied.
Book ChapterDOI
Time-Optimal Winning Strategies for Poset Games
TL;DR: A novel winning condition for infinite two-player games on graphs is introduced which extends the request-response condition and better matches concrete applications in scheduling or project planning.
Journal ArticleDOI
A New Modal Framework for Epistemic Logic
TL;DR: This work proposes a very general and powerful framework based on quantifier-free predicate language extended by a new modality $\Box^x$, which packs exactly $\exists x \Box$ together, and axiomatizes the logic over S5 frames with intuitive axioms to capture the interaction between $\Box$ and know-that operator in an epistemic setting.