Skip to main content
SpringerLink
Log in

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

  • Published:
Discrete Event Dynamic Systems Aims and scope Submit manuscript

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 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 exactly the state of the system, whereas local agents need to disambiguate certain pre-specified pairs of states for purposes of control or diagnosis. This requirement is achieved by communication, which occurs only between the central station and the local agents but not among the local agents. A communication policy is defined as a set of event occurrences to be communicated between the central station and the local agents. A communication policy is said to be minimal if any removal of communication of event occurrences will affect the correctness of the solution. Under an assumption on the absence of cycles (other than self-loops) in the system model, this paper presents an algorithm that computes a minimal communication policy in polynomial time in all parameters of the system. These results improve upon previous algorithms for solving minimum communication problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

Notes

  1. It can be seen by building an observer G obs that no state in G obs contains more than one state of G.

  2. Because the communications for self-loops have already been removed by Step 3.1 of Algorithm Min-Com-Cs, we only need to consider the set of events defined as self-loops with e ∈ E i here.

References

  • Barrett G, Lafortune S (1998) On the synthesis of communicating controllers with decentralized information structures for discrete-event systems. In: Proc. 37th IEEE conf. on decision and control, pp 3281–3286

  • Barrett G, Lafortune S (1999) Some issues concerning decentralized control problems with communication. In: Proc. 38th IEEE conf. on decision and control

  • Barrett G, Lafortune S (2000) Decentralized supervisory control with communicating controllers. IEEE Trans Automat Contr 45(9):1620–1638

    Article  MATH  MathSciNet  Google Scholar 

  • Bhutani K, Khan B (2002) Minimizing communication costs in hierarchical multi-agent systems. In: Proc. 6th joint conference on information sciences, pp 1435–1442

  • Boel RK, vanSchuppen JH (2002) Decentralized failure diagnosis for discrete-event systems with costly communication between diagnosers. In: Proc. 6th international workshop on discrete event systems (WODES’02), pp 175–181

  • Cassandras CG, Lafortune S (1999) Introduction to discrete event systems. Kluwer Academic Publishers

  • Debouk R, Lafortune S, Teneketzis D (2000) Coordinated decentralized protocols for failure diagnosis of discrete-event systems. Discret Event Dyn Syst: Theory Appl 10(1/2):33–86

    Article  MATH  MathSciNet  Google Scholar 

  • Han G, Wang J (2005) An efficient communication strategy for mobile agent based distributed spatial data mining application. In: Proc. SPIE—The international society for optical engineering, pp 538–541

  • Lafortune S (2007) On decentralized and distributed control of partially-observed discrete event systems. In: Bonivento C, Isidori A, Marconi L, Rossi C (eds) Advances in control theory and applications—lecture notes in control and information sciences. Springer

  • Lin F, Rudie K, Lafortune S (2007) Minimal communication for essential transitions in a distributed discrete-event system. IEEE Trans Automat Contr 52(8):1495–1502

    Article  MathSciNet  Google Scholar 

  • Ricker SL, Rudie K (1999) Incorporating communication and knowledge into decentralized discrete-event systems. In: Proc. 38th IEEE conf. on decision and control, pp 1326–1332

  • Ricker SL, van Schuppen JH (2001) Decentralized failure diagnosis with asynchronuous communication between supervisors. In: Proc. European control conf., pp 1002–1006

  • Rudie K, Willems JC (1995) The computational complexity of decentralized discrete-event control problems. IEEE Trans Automat Contr 40(7):1313–1318

    Article  MATH  MathSciNet  Google Scholar 

  • Rudie K, Lafortune S, Lin F (2003) Minimal communication in a distributed discrete-event system. IEEE Trans Automat Contr 48(6):957–975

    Article  MathSciNet  Google Scholar 

  • Shen J, Lesser V, Carver N (2003) Minimizing communication cost in a distributed bayesian network using a decentralized MDP. In: Proc. 2nd international joint conference on autonomous agents and multiagent systems, pp 678–685

  • Thorsley D, Teneketzis D (2004) Active acquisition of information for diagnosis of discrete event systems. In: Proc. allerton conference on control, communication, and computing

  • Thorsley D, Teneketzis D (2006) Diagnosis of cyclic discrete-event systems using active acquisition of information. In: Proc. 8th international workshop on discrete event systems (WODES’06). University of Michigan-Ann Arbor

  • van Schuppen JH (2004) Decentralized control with communication between controllers. In: Blondel VD, Megretski A (eds) Unsolved problems in mathematical systems and control theory, pp 144–150. Princeton University Press, Princeton

    Google Scholar 

  • Wang W (2007) Optimization of communication and coverage in classes of distributed systems. PhD thesis, University of Michigan, Department of Electrical Engineering and Computer Science

  • Wang W, Lafortune S, Lin F (2006) A polynomial algorithm for minimizing communication in a distributed discrete event system with a central station. In: Proc. 45th IEEE conf. on decision and control, pp 6034–6040

  • Wang W, Lafortune S, Lin F (2007a) An algorithm for calculating indistinguishable states and clusters in finite-state automata with partially observable transitions. Syst Comput Controls 56(9): 656–661

    MathSciNet  Google Scholar 

  • Wang W, Lafortune S, Lin F (2007b) Minimization of communication in distributed discrete event systems. In: Proc. of 2007 European control conf

  • Wong KC, van Schuppen JH (1996) Decentralized supervisory control of discrete-event systems with communication. In: Proc. 3rd international workshop on discrete event systems (WODES’96), pp 284–289

  • Yoo TS, Lafortune S (2002) Polynomial-time verification of diagnosability of partially-observed discrete event systems. IEEE Trans Automat Contr 47(9):1491–1495

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, 48109, USA

    Weilin Wang & Stéphane Lafortune

  2. Department of Electrical and Computer Engineering, Wayne State University, Detroit, MI, 48202, USA

    Feng Lin

Authors
  1. Weilin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stéphane Lafortune
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Feng Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stéphane Lafortune.

Additional information

The research of the first two authors is supported in part by ONR grant N0001-14-03-1-0232 and by NSF grants CCR-0325571 and ECS-0624821. The research of the third author is supported in part by NSF grant ECS-0624828.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, W., Lafortune, S. & Lin, F. On the Minimization of Communication in Networked Systems with a Central Station. Discrete Event Dyn Syst 18, 415–443 (2008). https://doi.org/10.1007/s10626-008-0045-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10626-008-0045-4

Keywords

Search

Navigation