Networked Supervisor Synthesis Against Lossy Channels with Bounded Network Delays as Non-Networked Synthesis

TL;DR

This paper presents a method to synthesize networked supervisors for discrete event systems with lossy, delayed communication channels by transforming the problem into a classical supervisor synthesis task, enabling the use of existing tools.

Contribution

It introduces a model transformation approach that reduces the networked supervisor synthesis problem to a non-networked one, facilitating the use of standard synthesis tools for systems with bounded delays and losses.

Findings

Successfully synthesized a networked supervisor for a mini-guideway example.

Demonstrated the approach's compatibility with existing synthesis tools SuSyNA and TCT.

Guaranteed the existence of supremal networked supervisors through command non-deterministic supervisors.

Abstract

In this work, we study the problem of supervisory control of networked discrete event systems. We consider lossy communication channels with bounded network delays, for both the control channel and the observation channel. By a model transformation, we transform the networked supervisor synthesis problem into the classical (non-networked) supervisor synthesis problem (for non-deterministic plants), such that the existing supervisor synthesis tools can be used for synthesizing networked supervisors. In particular, we can use the (state-based) normality property for the synthesis of the supremal networked supervisors, whose existence is guaranteed by construction due to our consideration of command non-deterministic supervisors. The effectiveness of our approach is illustrated on a mini-guideway example that is adapted from the literature, for which the supremal networked supervisor has been synthesized in the synthesis tools SuSyNA and TCT.