Control synthesis of a class of DEDS

Abstract

A new control synthesis method suitable for a special kind of discrete event dynamic systems (DEDS) is presented in this paper. The systems to be controlled are modelled by a special class of Petri nets (PN) named state machine (SM). The class is distinctive by the fact that each PN transition has only one input place and only one output place. Bipartite directed graphs (BDG) are utilized in the control synthesis process. Namely, PN in general are (from the structure point of view) the BDG. Both the state reachability tree and the corresponding control one are developed in the straight‐line procedure starting from the given initial state and directed to the desirable terminal one as well as in the backtracking procedure starting from the terminal state and directed to the initial one. After a suitable intersection of both the straight‐lined state reachability tree and the backtracking one the state trajectories of the system are obtained. After the intersection of both the straight‐lined control reachability tree and the backtracking one the control interferences corresponding to the state trajectories are obtained.

Citation

Čapkovič, F. (2002), "Control synthesis of a class of DEDS", Kybernetes, Vol. 31 No. 9/10, pp. 1274-1281. https://doi.org/10.1108/03684920210443473