Automated Solving the Control Synthesis Problem for the Extended Class Of D.E.D.S.

Abstract

A generalization of the author's methods published recently is presented in this paper. It extends their validity to the wider class of DEDS (discrete event dynamic systems) to be controlled. Both the previous methods and the innovated one are suitable for the kind of DEDS described by ordinary Petri nets (OPN). However, while the previous methods can be successfully used only in case of DEDS described by the special class of OPN - so called state machines (SM) where each transition has only the single input place and the single output place - the innovated method can be used in case of DEDS described by the wider class of OPN - the bounded OPN (having a limited number of marks in their places) without any restriction on their structure. Thus, the validity of the methods is extended because the class of bounded OPN is undoubtedly wider than the class of OPN represented by SM. Both the original approach and the proposed one can alternatively utilize either ordinary directed graphs (ODG) or bipartite directed graphs (BDG).