Nonblocking Supervisory Control Synthesis of Timed Automata using Abstractions and Forcible Events

Aida Rashidinejad, Patrick van der Graaf, Michel A. Reniers

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

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 languageEnglish
Title of host publication16th IEEE International Conference on Control, Automation, Robotics and Vision, ICARCV 2020
PublisherInstitute of Electrical and Electronics Engineers
Pages1033-1040
Number of pages8
ISBN (Electronic)978-1-7281-7709-0
DOIs
Publication statusPublished - 8 Jan 2021
Event16th International Conference on Control, Automation, Robotics and Vision (ICARCV 2020) - Virtual, Shenzhen, China
Duration: 13 Dec 202015 Dec 2020
Conference number: 16

Conference

Conference16th International Conference on Control, Automation, Robotics and Vision (ICARCV 2020)
Abbreviated titleICARCV 2020
Country/TerritoryChina
CityVirtual, Shenzhen
Period13/12/2015/12/20

Fingerprint

Dive into the research topics of 'Nonblocking Supervisory Control Synthesis of Timed Automata using Abstractions and Forcible Events'. Together they form a unique fingerprint.

Cite this