应用Petri网的关联矩阵求最小割集的新方法  

A New Method to Identify Minimal Cut Sets Using the Incidence Matrix of Petri Nets

作　　者：武滢[1] 谢里阳[1] 李进冬[1] 

机构地区：[1]东北大学,沈阳110004

出　　处：《中国机械工程》2008年第9期1044-1047,共4页China Mechanical Engineering

基　　金：国家863高技术研究发展计划资助项目(2006AA04Z408)

摘　　要：在应用Petri网模型构建系统故障逻辑关系图的基础上,提出了一种应用Petri网的关联矩阵求最小割集的算法。具体方法是在关联矩阵中按行、列查找所表达的输入、输出关系,直到找到基本事件,并将对应事件按"与"、"或"关系展开,这样可以直接从关联矩阵中得出割集,再按照布尔吸收律、等幂率或素数法求出最小割集。应用关联矩阵法求有重复事件Petri网模型的最小割集简单明了。进行了基于Visual C++6.0的算法程序编制,并通过了检验。通过对某舰艇防空系统故障最小割集的求解说明了求解过程并证明了该算法的正确性。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＋＋ 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.

关 键 词：PETRI网 关联矩阵 重复事件 最小割集 

分 类 号：TB114.3[理学—概率论与数理统计]