Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
