Compositional construction of most general controllers
From MaRDI portal
Publication:2350495
DOI10.1007/s00236-015-0239-9zbMath1329.68186OpenAlexW608305877MaRDI QIDQ2350495
Sascha Klüppelholz, Christel Baier, Joachim Klein
Publication date: 24 June 2015
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-015-0239-9
Synthesis problems (93B50) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Synthesis of Reactive(1) designs
- Down the Borel hierarchy: solving Muller games via safety games
- The complexity of two-player games of incomplete information
- A decidable class of problems for control under partial observation
- Automata, logics, and infinite games. A guide to current research
- Strategy construction for parity games with imperfect information
- Modeling component connectors in Reo by constraint automata
- Synthesis of Trigger Properties
- A Compositional Framework for Controller Synthesis
- Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited
- Measuring Permissivity in Finite Games
- Compositional Control Synthesis for Partially Observable Systems
- Environment Assumptions for Synthesis
- Asynchronous Omega-Regular Games with Partial Information
- Computing Weakest Strategies for Safety Games of Imperfect Information
- Formal Verification for Components and Connectors
- Supervisory Control of a Class of Discrete Event Processes
- The Complexity of Tree Automata and Logics of Programs
- Permissive strategies: from parity games to safety games
- Reo: a channel-based coordination model for component composition
- Compositional Algorithms for LTL Synthesis
- The Complexity of Partial-Observation Parity Games
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Synthesis of Reo Connectors for Strategies and Controllers
- Algorithms for Omega-Regular Games with Imperfect Information
- Solving Sequential Conditions by Finite-State Strategies
- Safraless Compositional Synthesis