摘要
针对以往用Petri网求系统最小割集广泛采用分析库所的方法,证明了通过分析模型的变迁能够减少运算量,提出了组成系统最小割集的变迁序列的组合算法,并通过状态方程求取最小割集,最后通过实例验证了算法的正确性和简便性。
In allusion to the past method of analyze the place of the Petri net to get the minimal cut set （MCS）, the article firstly makes out that analyzing the transition can reduce the quantity of calculation, then put forward an arithmetic of transition sequence gather which constitutes the system＇ s minimal cut set, and get the minimal cut set through state function, at last validate the correctness and briefness of the arithmetic through an example.
出处
《系统仿真技术》
2011年第2期126-129,141,共5页
System Simulation Technology
