DEDS control synthesis problem solving

An approach to solving the problem of control synthesis of discrete event dynamic systems (DEDS) is presented in this paper. DEDS are expected here to be modelled by means of the ordinary Petri nets (PN) defined e.g. by Murata (1989) and Peterson (1981). Directed graphs (DG) described e.g. in the textbook (Diestel, 1997) are utilized at the control synthesis. There is an aspiration here to find the general approach applicable for DEDS modelled by means of the ordinary PN (OPN) in general without restrictions on their structure and dynamics (i.e. marking) peculiarities. The endeavor is supported by the previous author's results (Capkovic, 2003-1999) suitable for the special kinds of OPN like the state machines (SM) and bounded PN (BPN). The intelligent control synthesis (in case when the control task specifications are given) is pointed out too.