In: Proceedings of the second IEEE International Conference on Systems, Man and Cybernetics (SMC'02), October 6-9, 2002, Hammamet, Tunisia, Volume 4. IEEE Computer Society Press, October 2002.
Abstract: Usually, reduction techniques are proposed to transform the original model of the system into a simpler one, while preserving some properties of interest to be analyzed. In this paper, it is proposed to take advantage of the reduction of complexity provided by the application of transformations rules to ease the determination of a feasible control for the system considered. The proposed technique consists of building the reduced model and its constraints graph representing a set of timing constraints. Thus, checking the existence of feasible controls is performed by verifying admissibility conditions on the reduced model constraints graph. then, if feasible controls exist, their associated controls for the original model are made possible in a hierarchical way.
Back to the Petri Nets Bibliography