Minimization of communication in distributed discrete event systems

Weilin Wang, Stephane Lafortune, Feng Lin

Research output: Chapter in Book/Report/Conference proceedingConference PaperOther

4 Citations (Scopus)

Abstract

In this paper, the problem of minimizing communication in distributed systems is considered in a discrete-event formalism where the system is modeled as a finite-state automaton. There is a set of n communicating agents observing the behavior of the system for purposes of control or diagnosis. A set of communication policies for the agents is said to be minimal if communications cannot be removed without affecting the correctness of the solution. A more general formulation of the communication structure than prior works on this problem is considered. Under an assumption on the absence of cycles (other than self-loops) in the system model, an algorithm that computes a set of minimal communication policies in polynomial-time in the number of states of the system is presented. This is the first algorithm of its kind that achieves this complexity result.

Original languageEnglish
Title of host publication2007 European Control Conference, ECC 2007
PublisherIEEE, Institute of Electrical and Electronics Engineers
Pages4960-4967
Number of pages8
ISBN (Electronic)9783952417386
Publication statusPublished - 25 Mar 2015
Externally publishedYes
EventEuropean Control Conference 2007 - Kos, Greece
Duration: 2 Jul 20075 Jul 2007
Conference number: 9th
http://ecc07.ntua.gr/
https://ieeexplore.ieee.org/xpl/conhome/7065133/proceeding (Proceedings)

Conference

ConferenceEuropean Control Conference 2007
Abbreviated titleECC 2007
CountryGreece
CityKos
Period2/07/075/07/07
Internet address

Cite this