Compositional construction of most general controllers

DOI10.1007/S00236-015-0239-9MaRDI QIDQ2350495zbMATH OpenOpenAlexFDO

Authors Joachim Klein, Christel Baier, Sascha Klüppelholz

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

zbMATH Keywords

controller synthesistransition systemlinear-time temporal logic

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Synthesis problems (93B50) Temporal logic (03B44) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A compositional framework for controller synthesis
• Compositional controller synthesis for stochastic games
• Compositional Control Synthesis for Partially Observable Systems
• scientific article; zbMATH DE number 2163041
• Automata and games for synthesis

Cites work

• scientific article; zbMATH DE number 4158510 (Why is no real title available?)
• scientific article; zbMATH DE number 3492660 (Why is no real title available?)
• scientific article; zbMATH DE number 4124989 (Why is no real title available?)
• scientific article; zbMATH DE number 1759605 (Why is no real title available?)
• scientific article; zbMATH DE number 7311251 (Why is no real title available?)
• scientific article; zbMATH DE number 3189696 (Why is no real title available?)
• A compositional framework for controller synthesis
• A decidable class of problems for control under partial observation
• Algorithms for Omega-Regular Games with Imperfect Information
• Asynchronous \(\omega\)-regular games with partial information
• Automata, logics, and infinite games. A guide to current research
• Compositional Control Synthesis for Partially Observable Systems
• Compositional algorithms for LTL synthesis
• Computing Weakest Strategies for Safety Games of Imperfect Information
• Down the Borel hierarchy: solving Muller games via safety games
• Environment Assumptions for Synthesis
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Formal Verification for Components and Connectors
• Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited
• Measuring Permissivity in Finite Games
• Modeling component connectors in Reo by constraint automata
• On the power of imperfect information
• Permissive strategies: from parity games to safety games
• Reactive safety
• Reo: a channel-based coordination model for component composition
• Safraless Compositional Synthesis
• Solving Sequential Conditions by Finite-State Strategies
• Strategy construction for parity games with imperfect information
• Supervisory Control of a Class of Discrete Event Processes
• Synthesis of Reactive(1) designs
• Synthesis of Reo connectors for strategies and controllers
• Synthesis of Trigger Properties
• The Complexity of Tree Automata and Logics of Programs
• The complexity of partial-observation parity games
• The complexity of two-player games of incomplete information

Cited in

(5)

• Compositional Control Synthesis for Partially Observable Systems
• A compositional framework for controller synthesis
• Compositional Construction of Approximate Abstractions of Interconnected Control Systems
• Synthesizing permissive winning strategy templates for parity games
• Qualitative approximate behavior composition

Describes a project that uses

Uses Software

• Reo

This page was built for publication: Compositional construction of most general controllers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2350495)