关键词: Petri网；关联矩阵；重复事件；最小割集

Abstract:

A method using incidence matrix of Petri net to identify the minimal cut sets(MCS) was proposed. This method can find CS according to the relationship among inputs and outputs implied in the incidence matrix, finally using Boolean absorption law, idempotent law, or prime law to get MCS.This method also shows its advantage when dealing with models containing repeatable events. The Visual C++6.0 code was developed and several examples were performed to test it. A naval vessels aerial defense system was also analyzed to show the process of this method and finally its validity was proved.

Key words: Petri net；incidence matrix；repeatable event；minimal cut set