| 赋时Petri网的一种符号分析算法 |
| |
| 引用本文： | 熊太平,古天龙.赋时Petri网的一种符号分析算法[J].桂林电子科技大学学报,2006,26(3):181-186. |
| |
| 作者姓名： | 熊太平 古天龙 |
| |
| 作者单位： | 桂林电子科技大学,计算机系,广西,桂林,541004;桂林电子科技大学,计算机系,广西,桂林,541004 |
| |
| 基金项目： | 广西新世纪十百千人才工程基金 |
| |
| 摘 要： | 有序二叉决策图(Ordered Binary Decision Disgram-OBDD)是布尔函数表示的规范型,布尔函数的复杂运算可以基于OBDD得到极大地简化实现.在讨论基于OBDD的有界Petri网符号分析算法的基础上,对赋时位置Petri网的符号分析进行了研究,构造了一种扩展标识向量,给出了赋时Petri网分析的一种符号OBDD算法,实现了赋时Petri网的隐式描述与分析.实验表明,符号算法能处理较大规模赋时Petri网问题.
|
| 关 键 词： | 赋时位置Petri网 有序二叉决策图 符号算法 可达集 |
| 文章编号： | 1001-7437(2006)03-0181-06 |
| 修稿时间： | 2006年3月20日 |
Symbolic analysis algorithm for timed place petri nets |
| |
| XIONG Tai-ping,GU Tian-long.Symbolic analysis algorithm for timed place petri nets[J].Journal of Guilin Institute of Electronic Technology,2006,26(3):181-186. |
| |
| Authors: | XIONG Tai-ping GU Tian-long |
| |
| Abstract: | 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. |
| |
| Keywords: | timed place Petri nets ordered binary decision diagram symbolic algorithm reachability set |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
