Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (11): 84-86.
• 学术探讨 • Previous Articles Next Articles
Liu Guanjun and Chen Lijing
College of Information, Shandong University of Science and Technology, Qingdao, 266510 )
Received:
Revised:
Online:
Published:
刘关俊 陈黎静
通讯作者:
Abstract: This paper defines a class of petri nets such that , and proves that: when every element of the marking is great than zero, the reachability from to equals to the satisfiability of the state equation . Simultaneously, when the reachability equals to the satisfiability of the state equation, the following conclusions can be drawn: For every vector such that , there exists satisfying , and is an executable vector.
Key words: petri net, reachability, state equation, executable vector
摘要: 本文定义了一个petri网子类: ,满足条件 。本文证明:当目标标识 时,此petri网子类的可达性等价于状态方程 的可满足性。同时,当此petri网子类的可达性等价于状态方程可满足性时,可得出如下两点结论:①对于满足 的每个非平凡的非负整数向量 ,都 ;②对于满足 的每个非平凡的非负整数向量 , 都是 的一个可执行向量。
关键词: petri网, 可达性, 状态方程, 可执行向量
Liu Guanjun and Chen Lijing. a class of petri nets with equivalence of reachability and state equation satisfiability[J]. Computer Engineering and Applications, 2007, 43(11): 84-86.
刘关俊 陈黎静. 可达性等价于状态方程可满足性的一个petri网子类[J]. 计算机工程与应用, 2007, 43(11): 84-86.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/
http://cea.ceaj.org/EN/Y2007/V43/I11/84