By Topic

A Petri net algorithm for scheduling of generic restoration actions

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
$33 $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

4 Author(s)
Jaw-Shyang Wu ; Nat. Kaohsiung Inst. of Technol., Taiwan ; Chen-Ching Liu ; Kan-Lee Liou ; R. F. Chu

This paper is concerned with scheduling of the restoration actions. Generic restoration actions (GRAs) have been identified in the authors' previous research based on a variety of restoration strategies used by electric utilities. This paper proposed a scheduling method using the Petri net (PN) techniques. The PN model incorporates the conditions that have to be met before an action can be taken. The time required to perform an action is also modeled in the net. A token passing and a backward search process are used to identify the sequence of restoration actions and their timing. The advantages of the proposed methods are: (1) the time required to restore a subsystem can be estimated; (2) a systematical method is obtained for identification of the sequence of actions. The BN method has been tested with simulation cases

Published in:

IEEE Transactions on Power Systems  (Volume:12 ,  Issue: 1 )