## 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 language | English |
---|---|

Title of host publication | 2007 European Control Conference, ECC 2007 |

Publisher | IEEE, Institute of Electrical and Electronics Engineers |

Pages | 4960-4967 |

Number of pages | 8 |

ISBN (Electronic) | 9783952417386 |

Publication status | Published - 25 Mar 2015 |

Externally published | Yes |

Event | European Control Conference 2007 - Kos, Greece Duration: 2 Jul 2007 → 5 Jul 2007 Conference number: 9th http://ecc07.ntua.gr/ https://ieeexplore.ieee.org/xpl/conhome/7065133/proceeding (Proceedings) |

### Conference

Conference | European Control Conference 2007 |
---|---|

Abbreviated title | ECC 2007 |

Country | Greece |

City | Kos |

Period | 2/07/07 → 5/07/07 |

Internet address |