Cart (Loading....) | Create Account
Close category search window

Minimization of Communication of Event Occurrences in Acyclic Discrete Event Systems

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)
Weilin Wang ; Univ. of Michigan, Ann Arbor, MI ; Lafortune, S. ; Feng Lin

The problem of minimizing communication of event occurrences in systems modeled by finite-state automata is considered. There are 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 of event occurrences cannot be removed without affecting the correctness of the solution. 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.

Published in:

Automatic Control, IEEE Transactions on  (Volume:53 ,  Issue: 9 )

Date of Publication:

Oct. 2008

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.