Controllers for discrete event systems via morphisms

From MaRDI portal





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].











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)