Supervisor Synthesis for Networked Discrete Event Systems with Delays against Non-FIFO Communication Channels

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 represented by finite 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 firstly 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 finite state automata. Finally, an example will illustrate how the networked resilient supervisor will be synthesized.