Abstract
A new view on discrete event dynamic systems (DEDS) modelling and control synthesis is presented. The adjacency matrix of an oriented graph is successfully utilized in the DEDS control synthesis procedure. The state reachability tree in both the straight-line system dynamics development and the backtracking one are generated. To solve the DEDS control synthesis problem a suitable combination of both these kinds of model dynamics development is utilized, namely, the intersection of both the state reachability trees yields all feasible trajectories of the system dynamics development, i.e., all realizable possibilities of how to reach the prescribed terminal state from the given initial one, are automatically found. To choose the most suitable solution of the control synthesis problem, rule-based knowledge about the control task specifications is utilized.
Sign-in/Register to access full text options 
Free) 
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
