赋时Petri网的一种符号分析算法  

Symbolic analysis algorithm for timed place petri nets

作　　者：熊太平[1] 古天龙[1] 

机构地区：[1]桂林电子科技大学计算机系,广西桂林541004

出　　处：《桂林电子工业学院学报》2006年第3期181-186,共6页Journal of Guilin Institute of Electronic Technology

基　　金：广西自然科学基金(0448072)

摘　　要：有序二叉决策图(O rdered B inary D ec is ion D isgram-OBDD)是布尔函数表示的规范型,布尔函数的复杂运算可以基于OBDD得到极大地简化实现。在讨论基于OBDD的有界Petri网符号分析算法的基础上,对赋时位置Petri网的符号分析进行了研究,构造了一种扩展标识向量,给出了赋时Petri网分析的一种符号OBDD算法,实现了赋时Petri网的隐式描述与分析。实验表明,符号算法能处理较大规模赋时Petri网问题。Timed Petri net has been a promising technique to handle many problems associated with the modeling, formal analysis and scheduling of distributed and concurrent discrete event systems. Ordered binary decision diagram （OBDD） is a canonical form to represent and manipulate the Boolean functions efficiently. In this paper, OBDD-based symbolic analysis for bounded Petri nets is discussed, and the symbolic analysis algorithms for timed place Petri-nets are developed. The experimental results show that the symbolic algorithms can handle large-scale Petri nets.

关 键 词：赋时位置Petri网 有序二叉决策图 符号算法 可达集 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]