Controllers for discrete event systems via morphisms
Here the problem is formulated in a branching time framework. A class of labelled transition systems to model both the plant and the specification is used. It is shown that the problem of checking if a pair of finite transition systems -- one modelling the plant and the other the specification -- admits a controller is decidable in polynomial time. It is shown that the size of the finite controller, if one exists, can be bounded by a polynomial in the sizes of the plant and the specification. It is proved that in a natural concurrent setting, the problem of checking for the existence of a controller is undecidable. For the entire collection see [Zbl 0895.00051].
- Branching time controllers for discrete event systems
- Supervisory control of discrete event systems
- Dynamic control with indistinguishable events
- Supervisory Control of Discrete Event Systems with CTL* Temporal Logic Specifications
- On controllability of discrete event systems in a behavioral framework
- Undecidability of domino games and hhp-bisimilarity.
- Dynamic control with indistinguishable events
- Causality versus true-concurrency
- Interface synthesis and protocol conversion
- Causality, behavioural equivalences, and the security of cyberphysical systems
- Investigating discrete controllability with Kleene algebra
- Branching time controllers for discrete event systems
- The decidability border of hereditary history preserving bisimilarity
This page was built for publication: Controllers for discrete event systems via morphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4251912)