By Topic

On supervisory policies that enforce liveness in a class of completely controlled Petri nets obtained via refinement

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

1 Author(s)
Sreenivas, R.S. ; Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA

The authors consider Petri nets (PNs), where each transition can be prevented from firing by an external agent, the supervisor. A PN is said to be live if it is possible to fire any transition from every reachable marking, although not necessarily immediately. The procedure proposed previously by the author (1996) involves the construction of the coverability graph, which can be computationally expensive. Using the refinement/abstraction procedure of Suzuki and Murata (1983), where a single transition in a abstracted PN N is replaced by a PN Nˆ to yield a larger refined PN Nˆ, we show that when Nˆ belongs to a class of marked-graph PNs, there is a supervisory policy that enforces liveness in the refined PN Nˆ if and only if there is a similar policy for the abstracted PN N. Since the coverability graph of the PN N is smaller than that of the PN Nˆ, it is possible to achieve significant computational savings by using the process of abstraction on Nˆ. This is illustrated by example.

Published in:

Automatic Control, IEEE Transactions on  (Volume:44 ,  Issue: 1 )