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
Finite system composition and interaction
TL;DR: It is proven for finite systems that if by reciprocal interaction, one finite system determines the action of another finite system, then both systems become subsystems of a larger supersystem.
Book ChapterDOI
Model construction and priority synthesis for simple interaction systems
TL;DR: The synthesis engine of VISSBIP is based on automata-based (game-theoretic) notions and checks if the system satisfies a given safety property, and automatically generates additional constraints on the interactions that ensure the desired property.
Book ChapterDOI
A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity
Thomas Erlebach,Jakob T. Spooner +1 more
TL;DR: This paper considers a game in which a single cop and a single robber take turns moving along the edges of a given graph $G$ if there exists a strategy for the cop which enables it to be positioned at the same vertex as the robber eventually, then £G is called cop-win, and robber-win otherwise.
Book ChapterDOI
Feasibility analysis of sporadic real-time multiprocessor task systems
TL;DR: The first algorithm for testing the feasibility of a system of sporadic real-time tasks on a set of identical processors is given, solving an open problem in the area of multiprocessor real- time scheduling.
Proceedings Article
Description logic based dynamic systems: modeling, verification, and synthesis
TL;DR: The recently introduced general framework of Description Logic Based Dynamic Systems, which leverages Levesque's functional approach to model systems that evolve the extensional part of a description logic knowledge base by means of actions, is overviewed.