Minimal Communication for Essential Transitions in a Distributed Discrete-Event System

In a distributed discrete-event system with decentralized information, agents at the various sites (e.g., controllers or diagnosers) may be required to communicate in order to correctly perform some prescribed tasks. Bandwidth, power, or security constraints motivate the design of communication prot...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on automatic control 2007-08, Vol.52 (8), p.1495-1502
Main Authors: Feng Lin, Rudie, K., Lafortune, S.
Format: Article
Language:English
Subjects:
Algebra
Algorithms
Applied sciences
Assembly systems
Automatic control
Capacity planning
Communication systems
Computer information security
Computer science
control theory
systems
Control systems
Control theory. Systems
Controllers
Decentralized
Design engineering
Discrete event systems
distributed control
distributed diagnosis
Equations
Exact sciences and technology
minimal communication
Modelling and identification
Production systems
Stochastic processes
Stochastic systems
Supply chains
Tasks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In a distributed discrete-event system with decentralized information, agents at the various sites (e.g., controllers or diagnosers) may be required to communicate in order to correctly perform some prescribed tasks. Bandwidth, power, or security constraints motivate the design of communication protocols among agents that minimize the number of required communications. This note presents an algorithm that can synthesize such a communication protocol given a set of ldquoessential transitionsrdquo that constitute the initial required communications. The synthesized communication protocol is shown to be minimal.
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.2007.902761