Abstract
Conventional supervisory control synthesis techniques are not adequate for timed automata (TA) due to their infinite state space. This paper presents a supervisory control synthesis technique for TA with the objective of satisfying controllability and nonblockingness. The synthesis method consists of three steps. First, a TA is abstracted to a finite automaton (FA). The event set of the FA includes the discrete events of the TA as well as an event representing the passage of a significant amount of time. Time passage is considered to be preemptable by events from a given set of forcible events. Second, an algorithm is presented to synthesize a controllable and nonblocking supervisor for the FA. Finally, a time-refinement technique is proposed to convert the supervisor to a TA.
Original language | English |
---|---|
Title of host publication | 16th International Conference on Control, Automation, Robotics and Vision (ICARCV) |
Pages | 1 |
Number of pages | 8 |
DOIs | |
Publication status | Published - 8 Jan 2021 |