Supervisory control of time-interval discrete event systems
Since the timed supervisory control framework was proposed, it has been adopted in many subsequent developments in various areas. Yet, the mechanism of explicitly enumerating time in terms of sequences of ticks significantly increases the number of states, causing major computational challenges i...
Saved in:
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2021
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/152247 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-152247 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-1522472021-08-16T06:42:05Z Supervisory control of time-interval discrete event systems Brandin, Bertil Su, Rong Lin, Liyong School of Electrical and Electronic Engineering IFAC-PapersOnLine Engineering::Electrical and electronic engineering Interval Automata Event Forcing Timed Controllability Since the timed supervisory control framework was proposed, it has been adopted in many subsequent developments in various areas. Yet, the mechanism of explicitly enumerating time in terms of sequences of ticks significantly increases the number of states, causing major computational challenges in supervisor synthesis. To overcome this challenge, in this work we develop a theory of supervisory control of time-interval discrete event systems, whereby intervals are used to compactly encode sequences of ticks. By introducing the concepts of free and coercive (interval) languages, we are able to describe the impact of event forcing (i.e., time preemption) in a resulting time-interval language, upon which we introduce controllability property. It turns out that coercive languages are not closed under union, in contrast to free languages. The supremal controllable coercive language for a given time-interval plant and time-interval requirement exists, which can be computed by a synthesis algorithm presented in this paper. Ministry of Education (MOE) National Research Foundation (NRF) Published version This work is financially supported by Singapore Ministry of Education Tier 1 Academic Research Grant (2018-T1-001-245 (RG91/18)) and the National Research Foundation of Singapore Delta-NTU Corporate Lab Program with the project reference of DELTA-NTU CORP-SMA-RP2, which is gratefully acknowledged. 2021-08-16T06:34:38Z 2021-08-16T06:34:38Z 2021 Journal Article Brandin, B., Su, R. & Lin, L. (2021). Supervisory control of time-interval discrete event systems. IFAC-PapersOnLine, 53(4), 217-222. https://dx.doi.org/10.1016/j.ifacol.2021.04.022 2405-8963 https://hdl.handle.net/10356/152247 10.1016/j.ifacol.2021.04.022 4 53 217 222 en 2018-T1-001-245 (RG91/18) DELTA-NTU CORP-SMA-RP2 IFAC-PapersOnLine © 2020 The Authors. This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0). application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
language |
English |
topic |
Engineering::Electrical and electronic engineering Interval Automata Event Forcing Timed Controllability |
spellingShingle |
Engineering::Electrical and electronic engineering Interval Automata Event Forcing Timed Controllability Brandin, Bertil Su, Rong Lin, Liyong Supervisory control of time-interval discrete event systems |
description |
Since the timed supervisory control framework was proposed, it has been adopted in
many subsequent developments in various areas. Yet, the mechanism of explicitly enumerating
time in terms of sequences of ticks significantly increases the number of states, causing major
computational challenges in supervisor synthesis. To overcome this challenge, in this work we
develop a theory of supervisory control of time-interval discrete event systems, whereby intervals
are used to compactly encode sequences of ticks. By introducing the concepts of free and coercive
(interval) languages, we are able to describe the impact of event forcing (i.e., time preemption) in
a resulting time-interval language, upon which we introduce controllability property. It turns out
that coercive languages are not closed under union, in contrast to free languages. The supremal
controllable coercive language for a given time-interval plant and time-interval requirement
exists, which can be computed by a synthesis algorithm presented in this paper. |
author2 |
School of Electrical and Electronic Engineering |
author_facet |
School of Electrical and Electronic Engineering Brandin, Bertil Su, Rong Lin, Liyong |
format |
Article |
author |
Brandin, Bertil Su, Rong Lin, Liyong |
author_sort |
Brandin, Bertil |
title |
Supervisory control of time-interval discrete event systems |
title_short |
Supervisory control of time-interval discrete event systems |
title_full |
Supervisory control of time-interval discrete event systems |
title_fullStr |
Supervisory control of time-interval discrete event systems |
title_full_unstemmed |
Supervisory control of time-interval discrete event systems |
title_sort |
supervisory control of time-interval discrete event systems |
publishDate |
2021 |
url |
https://hdl.handle.net/10356/152247 |
_version_ |
1709685327481798656 |