We study the problem of synthesising contorlers for discrete event systems.Traditonally this problem is tackled in a linear time setting.moreover,the desired subsret of the computations of the uncontrolloed systme (often called a plant) is specified by automata theoretic means.Here we formulate the problem in a branching time framework.We use a class of labelled transition systems to modle both the plant and the specificaiton.We deploy behaviour preserving morphisms oto capture related via a behviour preserving morphism to the specificaiton at the level of unfoldings.One msut go over to unfoldings in order to let the controller use memory of the past to carry out its function.
展开▼
