A Petri net algorithm for scheduling of generic restoration actions

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