A Petri net algorithm for scheduling of generic restoration actions

Author

Wu, Jaw-shyang ; Chen-Ching Liu ; Kan-Lee Liou ; Chu, Ron F.

Author_Institution

Nat. Kaohsiung Inst. of Technol., Taiwan

Volume

12

Issue

1

fYear

1997

fDate

2/1/1997 12:00:00 AM

Firstpage

69

Lastpage

76

Abstract

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

Keywords

Petri nets; electricity supply industry; power system restoration; scheduling; Petri net algorithm; backward search; electric utilities; generic restoration scheduling; power systems; token passing; Knowledge based systems; Power system modeling; Power system protection; Power system restoration; Power system simulation; Scheduling algorithm; Senior members; Skeleton; Testing; Timing;

fLanguage

English

Journal_Title

Power Systems, IEEE Transactions on

Publisher

ieee

ISSN

0885-8950

Type

jour

DOI

10.1109/59.574925

Filename

574925