摘要
在高级Petri网的性质分析中,S—不变量的方法是一个重要的方法,如何计算高级Petri网的S—不变量是一个重要课题。本文基于复合标志(Token)和标志流路的概念,给出了一个整系数线性方程系统,由该线性方程系统,可以得到高级Petri网的所有S—不变量,而不必将高级Petri网扩展为一般Petri网。
Net invariants and reachability trees are used to investigate dynamic properties of Petri Nets. Both concepts have been generalized for different classes of High Level Petri Nets. In this paper we introduce the compound token and the token flow path concepts. An algorithm for computing the S-invariants of High Level Petri Nets is presented. In the algorithm, the compound token and the token flow path ideas are adopted and all S -invariants of an HLPN can be generated by a system of integer linear equations without unfolding the net.
出处
《软件学报》
EI
CSCD
北大核心
1992年第3期49-55,共7页
Journal of Software
