Abstract
A new view on modelling a class of discrete event dynamic system (DEDS) and a corresponding control synthesis procedure are presented. The class can be described by state machines (SM) — the special kind of Petri nets (PN). The adjacency matrix of oriented graphs (OG) is utilized in the control synthesis procedure. It helps to generate the state reachability tree in both the straight-lined system development (starting from a given initial state to a prescribed terminal one) and that of the backtracking one (starting from the prescribed terminal state to the initial one). Combinig both of the model developments (i.e. a special intersection both of the reachability trees) makes the control synthesis posible.
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 call
