By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Feng Lin ; Wayne State Univ., Detroit ; Rudie, K. ; Lafortune, S.

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.

Published in:

Automatic Control, IEEE Transactions on  (Volume:52 ,  Issue: 8 )