基于Petri网结构特性的可达性求解
    点此下载全文
引用本文:段 珊,王金娟.基于Petri网结构特性的可达性求解[J].计算技术与自动化,2022,(2):168-172
摘要点击次数: 49
全文下载次数: 0
作者单位
段 珊,王金娟 (湖南涉外经济学院 信息与机电工程学院湖南 长沙 410205) 
中文摘要:以Petri网关联矩阵为基础,根据状态方程将变迁向量解表达为T_不变量与方程特解的线性组合;当特解向量中不存在合法引发序列时,从该向量出发,以逆序的方式获取借库所,构建借库所链;利用借库所关联的变迁向量之间的借还逻辑和数目依次求解T_不变量的发生系数,得到一个较小的可达变迁向量。这种求解算法不仅可以实现目的可达的有效求解,还可以利用借库所链的中断对目的不可达进行直接快速的判断,避免后续不必要的相关工作;同时借库所的获取、T_不变量系数的分析计算都是分区块进行的,大大缩小了探索范围,也简化了计算操作;借库所链中种蕴含的变迁引发逻辑也可以启发方式帮助可达变迁向量快捷建立合法引发次序。
中文关键词:Petri网  关联矩阵  T-不变量  借库所  可达变迁向量
 
Solving Reachability Based on Structure Characteristics of Petri Net
Abstract:Based on the Petri net incidence matrix, the transition vector solution is expressed as a linear combination of T_invariant and the special solution of the equation according to the state equation. When there is no legal firing sequence in the special solution vector, starting from the vector, obtaining the borrowing place in reverse order, constructing the borrowing place chain.Using the borrowing-returning logic and the number of the transition vectors associated with the borrowing place to solve the firing coefficient of T_invariant in turn, a smaller reachable transition vector is obtained. This solution algorithm can not only achieve effective solutions with reachable goals, but also make use of the break of the borrowing place chain to directly and quickly judge the unreachable goals, avoiding subsequent unnecessary related work. At the same time, obtain of borrowing place, analysis and calculation of T_invariant coefficients are carried out in sub_regions, which greatly reduces the scope of exploration and simplifies the calculation operation. The trigger logic of transition implicated in the borrowing place chain can also heuristically help the reachable transiton vector to establish a legal trigger sequence.
keywords:Petri net  incident matrix  T_invariant  borrowing token places  reachable transition vector
查看全文   查看/发表评论   下载pdf阅读器