Abstract

In this work, we study the supervisory control of networked discrete event systems with communication delays and lossy channels. Both the observation and control communication channels are represented by finite (FIFO queue) automata under the assumption that all communication delays are bounded and the sizes of both queues are finite. By a transformation of the plant and specification, we show that it is possible to reduce networked supervisor synthesis to supervisor synthesis in the standard Ramadge-Wonham framework.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call