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

Aida Rashidinejad; P. van der Graaf; Michel A. Reniers

doi:10.1109/ICARCV50220.2020.9305312

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

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

Control Systems Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-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 language	English
Title of host publication	16th International Conference on Control, Automation, Robotics and Vision (ICARCV)
Pages	1
Number of pages	8
DOIs	https://doi.org/10.1109/ICARCV50220.2020.9305312
Publication status	Published - 8 Jan 2021

Access to Document

10.1109/ICARCV50220.2020.9305312

Cite this

@inproceedings{6d113120e9fc4d818ab9bab677a92f97,

title = "Nonblocking Supervisory Control Synthesis of Timed Automata using Abstractions and Forcible Events",

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.",

author = "Aida Rashidinejad and {van der Graaf}, P. and Reniers, {Michel A.}",

year = "2021",

month = jan,

day = "8",

doi = "10.1109/ICARCV50220.2020.9305312",

language = "English",

pages = "1",

booktitle = "16th International Conference on Control, Automation, Robotics and Vision (ICARCV)",

}

Nonblocking Supervisory Control Synthesis of Timed Automata using Abstractions and Forcible Events. / Rashidinejad, Aida; van der Graaf, P.; Reniers, Michel A.

16th International Conference on Control, Automation, Robotics and Vision (ICARCV). 2021. p. 1.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

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

AU - Rashidinejad, Aida

AU - van der Graaf, P.

AU - Reniers, Michel A.

PY - 2021/1/8

Y1 - 2021/1/8

N2 - 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.

AB - 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.

U2 - 10.1109/ICARCV50220.2020.9305312

DO - 10.1109/ICARCV50220.2020.9305312

M3 - Conference contribution

SP - 1

BT - 16th International Conference on Control, Automation, Robotics and Vision (ICARCV)

ER -