A supervisor is generated with Supervisory Control Theory [3], resulting in a nonblocking and minimally restrictive controller. Time is introduced time using timed automata theory. A compact data structure is used to keep track of the time information in the timed automata: Heaps of Pieces [2]. The fastest sequence of events is found, using graph search algorithms of Dijkstra and A [1]. This is...

Supervisory control of the mobile robot navigation system has critical importance. The supervisory control software development of mobile robot navigation can be performed in an unknown environment or for controlled robots in a known environment. Finite automata and graph theory are functional tools in modeling the robot navigation system through discrete environment. This research has emphasis...

Coalgebraic techniques are applied to the supervisory control of discrete-event systems with partial observations. Classical notions from concurrency theory are specialized to control theory. The concept of weak transitions enables the relational characterization of observability and gives rise to a coalgebraic formulation of the necessary and sufficient conditions for the existence of a superv...