On the Minimization of Communication in Networked Systems with a Central Station

The problem of minimizing communication in a distributed networked system is considered in a discrete-event formalism where the system is modeled as a finite-state automaton. The system consists of a central station and a set of N local agents, each observing a set of local events. The central station needs to know The research of the first two authors is supported in part by ONR grant N0001-14-03-1

• Type: Journal
• Year: 2008
• Where: DEDS
• Authors: Weilin Wang, Stéphane Lafortune, Feng Lin
• Keywords: Central Station, DEDS 2008, Discrete-event Formalism, Finite-state Automaton