May 14, 2008 · This paper presents an algorithm that computes a minimal communication policy in polynomial time in all parameters of the system.

This paper presents an algorithm that computes a minimal communication policy in polynomial time in all parameters of the system.

Abstract: The problem of minimizing communication in a distributed networked system is considered in a discrete-event formalism where the system is modeled as a ...

On the minimization of communication in networked systems with a central station. W Wang, S Lafortune, F Lin. Discrete Event Dynamic Systems 18 (3), 415-443, ...

On the minimization of communication in networked systems with a central station‏. W Wang, S Lafortune, F Lin‏. Discrete Event Dynamic Systems 18 (3), 415-443, ...

Lin "On the Minimization of Communication in Networked Systems with a Central Station" Discrete Event Dynamic Systems: Theory and Applications , v.18 , 2008 ...

On the Minimization of Communication in Networked Systems with a Central Station. Weilin Wang; Stéphane Lafortune; Feng Lin. OriginalPaper 14 May 2008 Pages ...

On the Minimization of Communication in Networked Systems with a Central Station · Computer Science. Discrete event dynamic systems · 2008.

In this paper, we investigate supervisory control of networked discrete event systems. Such systems are now widely used in practice.

On the Minimization of Communication in Networked Systems with a Central Station · Weilin Wang · Stéphane Lafortune · Feng Lin ...