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
Journal ArticleDOI
Unbounded Orchestrations of Transducers for Manufacturing
TL;DR: This paper considers the more general problem of whether a controller can be synthesized given sufficient resources, and shows that the unbounded orchestration problem is decidable and the (Pareto) optimal set of resources necessary to manufacture a product is computable for uni-transducers.
Journal ArticleDOI
Auditor Product and Controller Synthesis for Nondeterministic Transition Systems With Practical LTL Specifications
M. Hadi Zibaeenejad,Jun Liu +1 more
TL;DR: This work considers the specifications that are in the conjunctive form of practical LTL patterns to reduce the complexity of controller design for continuous systems with linear temporal logic (LTL) specifications.
Expressiveness of Monadic Second-Order Logics on Infinite Trees of Arbitrary Branching Degree
Fabio Zanasi,Johan van Benthem,Alessandro Facchini,Helle Hvid Hansen,Benedikt Löwe,Yde Venema +5 more
TL;DR: It is shown that the alternation-free fragment of the modal μ-calculus and the bisimulation-invariant fragment of well-founded MSO have the same expressive power on trees of arbitrary branching degree, and motivated by the conjecture that weak MSO modulo bisimulations collapses inside MSO and well- founded MSO.
Book ChapterDOI
Strategy composition in compositional games
TL;DR: A suitable notion of strategy composition is defined and it is shown how, for the first notion of product, winning strategies in reachability games can be composed from Winning strategies in games on the constituent arenas.
Book ChapterDOI
Local abstraction-refinement for the mu-calculus
Harald Fecher,Sharon Shoham +1 more
TL;DR: A new CEGAR-based algorithm for the modal µ-calculus is presented, based on a more expressive abstract model and applies refinement only locally (at a single abstract state), i.e., the lazy abstraction technique for safety properties is adapted to the µ-Calculus.