In networked control systems, uncontrollable events may unexpectedly occur in a plant before a proper control action is applied to the plant due to communication delays. In the area of supervisory control of discrete event systems, Park and Cho [5] proposed the notion of delay-nonconflictingness for the existence of a supervisor achieving a given language specification under communication delays. In this paper, we present the algebraic properties of delay-nonconflicting languages which are necessary for solving supervisor synthesis problems under communication delays. Specifically, we show that the class of prefix-closed and delay-nonconflicting languages is closed under intersection, which leads to the existence of a unique infimal prefix-closed and delay-nonconflicting superlanguage of a given language specification.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Jung-Min YANG, Seong-Jin PARK, "On Algebraic Properties of Delay-Nonconflicting Languages in Supervisory Control under Communication Delays" in IEICE TRANSACTIONS on Fundamentals,
vol. E91-A, no. 8, pp. 2237-2239, August 2008, doi: 10.1093/ietfec/e91-a.8.2237.
Abstract: In networked control systems, uncontrollable events may unexpectedly occur in a plant before a proper control action is applied to the plant due to communication delays. In the area of supervisory control of discrete event systems, Park and Cho [5] proposed the notion of delay-nonconflictingness for the existence of a supervisor achieving a given language specification under communication delays. In this paper, we present the algebraic properties of delay-nonconflicting languages which are necessary for solving supervisor synthesis problems under communication delays. Specifically, we show that the class of prefix-closed and delay-nonconflicting languages is closed under intersection, which leads to the existence of a unique infimal prefix-closed and delay-nonconflicting superlanguage of a given language specification.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e91-a.8.2237/_p
Copy
@ARTICLE{e91-a_8_2237,
author={Jung-Min YANG, Seong-Jin PARK, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On Algebraic Properties of Delay-Nonconflicting Languages in Supervisory Control under Communication Delays},
year={2008},
volume={E91-A},
number={8},
pages={2237-2239},
abstract={In networked control systems, uncontrollable events may unexpectedly occur in a plant before a proper control action is applied to the plant due to communication delays. In the area of supervisory control of discrete event systems, Park and Cho [5] proposed the notion of delay-nonconflictingness for the existence of a supervisor achieving a given language specification under communication delays. In this paper, we present the algebraic properties of delay-nonconflicting languages which are necessary for solving supervisor synthesis problems under communication delays. Specifically, we show that the class of prefix-closed and delay-nonconflicting languages is closed under intersection, which leads to the existence of a unique infimal prefix-closed and delay-nonconflicting superlanguage of a given language specification.},
keywords={},
doi={10.1093/ietfec/e91-a.8.2237},
ISSN={1745-1337},
month={August},}
Copy
TY - JOUR
TI - On Algebraic Properties of Delay-Nonconflicting Languages in Supervisory Control under Communication Delays
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2237
EP - 2239
AU - Jung-Min YANG
AU - Seong-Jin PARK
PY - 2008
DO - 10.1093/ietfec/e91-a.8.2237
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E91-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 2008
AB - In networked control systems, uncontrollable events may unexpectedly occur in a plant before a proper control action is applied to the plant due to communication delays. In the area of supervisory control of discrete event systems, Park and Cho [5] proposed the notion of delay-nonconflictingness for the existence of a supervisor achieving a given language specification under communication delays. In this paper, we present the algebraic properties of delay-nonconflicting languages which are necessary for solving supervisor synthesis problems under communication delays. Specifically, we show that the class of prefix-closed and delay-nonconflicting languages is closed under intersection, which leads to the existence of a unique infimal prefix-closed and delay-nonconflicting superlanguage of a given language specification.
ER -