Maximally permissive controlled system synthesis for non-determinism and modal logic
DOI10.1007/s10626-016-0231-8zbMath1356.93030OpenAlexW2522848592WikidataQ59519582 ScholiaQ59519582MaRDI QIDQ513185
W. J. Fokkink, A. C. van Hulst, Michel Reniers
Publication date: 3 March 2017
Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10626-016-0231-8
controllabilitymodal logicnon-determinismmaximal permissivenesscontrolled system synthesispartial bisimulation
Analysis of algorithms and problem complexity (68Q25) Controllability (93B05) Application models in control theory (93C95) Modal logic (including the logic of norms) (03B45) Synthesis problems (93B50)
Related Items (4)
Uses Software
Cites Work
- On modal \(\mu \)-calculus and Gödel-Löb logic
- A class of non-deterministic specifications for supervisory control
- Games for synthesis of controllers with partial observation.
- A linear-time model-checking algorithm for the alternation-free modal mu- calculus
- Introduction to Discrete Event Systems
- Supervisory Control of Discrete Event Systems with CTL* Temporal Logic Specifications
- Hierarchical Synthesis of Hybrid Controllers from Temporal Logic Specifications
- Supervisory Control of a Class of Discrete Event Processes
- Algebraic laws for nondeterminism and concurrency
- Maximally Permissive Controlled System Synthesis for Modal Logic
- Mathematical Foundations of Computer Science 2003
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Maximally permissive controlled system synthesis for non-determinism and modal logic