Petri net-based modeling of switching arrangements and simulation

This paper proposes a Petri net-based method of switching arrangements for substation switching actions considering a variety of substation security regulations. Based on Petri nets, we study the reachability problem of the switching arrangements for a single-line substation diagram which contains a series of switching bays. A new decomposition approach is applied to developing a synthetical rule/case-based programming formulation to characterize the reachability sets of the Petri nets. Consequently, the reachability problem based on substation security regulations is represented as a constraint satisfaction problem whether the switching sequence violates any interlocking constraint.