Please use this identifier to cite or link to this item:
|Title:||Supervisor synthesis for networked discrete event systems with delays against non-FIFO communication channels||Authors:||Zhu, Yuting
|Keywords:||Engineering::Electrical and electronic engineering||Issue Date:||2021||Source:||Zhu, Y., Lin, L., Tai, R. & Su, R. (2021). Supervisor synthesis for networked discrete event systems with delays against non-FIFO communication channels. 2020 16th International Conference on Control, Automation, Robotics and Vision (ICARCV), 1027-1032. https://dx.doi.org/10.1109/ICARCV50220.2020.9305500||Project:||M4061925.043
|Abstract:||In this work, we study the problem of supervisory synthesis for networked discrete event systems against non- FIFO communication channels with bounded delays. Both the observation and control communication channels are repre- sented by ﬁnite state automata under the assumption that all communication delays are bounded, the resilient networked supervisor synthesis problem is then reduced to supervisor synthesis for non-deterministic automata. We ﬁrstly analyze the structure of networked discrete-event systems with delays, and then describe the message transmission process through the communication channels which connect the plant and the supervisor. The assumption of the networked discrete event systems: 1)The buffer size of the communication channels is limited; 2)There is a maximum delay boundary for each event in the communication channel; 3)The number of multiple copies of the same event in the communication channel is limited. The content of the observation and control channel will be represented by the timed ﬁnite state automata. Finally, an example will illustrate how the networked resilient supervisor will be synthesized.||URI:||https://hdl.handle.net/10356/152243||DOI:||10.1109/ICARCV50220.2020.9305500||Rights:||© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: https://doi.org/10.1109/ICARCV50220.2020.9305500.||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||EEE Conference Papers|
Updated on Jan 23, 2022
Updated on Jan 23, 2022
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.