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
Temporal assertions for sequential and concurrent programs
TL;DR: This thesis presents an extension to the well-known concept of assertions: temporal assertions allow the specification and validation of modal safety properties of an application at runtime, and comments on the necessity and advantages of storing such semantic annotations about the application in a machine-readable format.
Journal ArticleDOI
Learning-Based Probabilistic LTL Motion Planning With Environment and Motion Uncertainties
TL;DR: A reinforcement learning-based approach is developed to generate policies that fulfill the desired LTL specifications as much as possible by optimizing the expected discount utility of the relaxed product MDP.
Book ChapterDOI
Strategy Construction for Parity Games with Imperfect Information
TL;DR: This paper builds on the antichain approach to develop an algorithm for constructing the winning strategies in parity games of imperfect information and has implemented this algorithm as a prototype, which is the first implementation of a procedure for solving imperfect-information parity games on graphs.
Journal ArticleDOI
Monotonic and Downward Closed Games
TL;DR: It is shown that monotonic games with safety winning conditions are in general undecidable for games which are defined over Petri nets, and it is also shown that weak parity games are undECidable for the above classes of games.
Proceedings ArticleDOI
On the Boundary of Behavioral Strategies
TL;DR: This paper investigates two syntactical fragments of Strategy Logic, namely the conjunctive-goal and disjunctive- goal, called SL[CG] and SL[DG] for short, and proves that their semantics admit behavioral strategies only.