By Topic

Blocking in Fully Connected Networks of Arbitrary Size

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

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

2 Author(s)
Nazari, S. ; Dept. of Electr. & Comput. Eng., Univ. of Waterloo, Waterloo, ON, Canada ; Thistle, J.G.

The problem of checking blocking properties is studied for networks consisting of arbitrary numbers of finite-state discrete-event subsystems. The topology of the networks is that of a fully connected graph: any subsystem can potentially interact with any other. Two types of blocking are studied: component blocking, whereby a subsystem is potentially prevented from entering its set of marker states, and network blocking, whereby the subsystems are potentially unable to occupy marker states simultaneously. It is shown that if the subsystems are all identical and broadcast actions are permitted, both types of blocking properties are undecidable; but in the absence of broadcast actions, they become decidable. If the subsystems are not necessarily identical but only isomorphic, then blocking properties are in general undecidable; however, a template is proposed for ensuring adequate structure for decidability. It is claimed that this template is sufficiently general to admit many realistic examples.

Published in:

Automatic Control, IEEE Transactions on  (Volume:57 ,  Issue: 5 )