摘要
1 引言
Petli网作为系统模拟和分析的工具已得到广泛的应用.Petri网一个变迁序列可理解为一个字符串,字符串集合为一种语言.所有可能发生的变迁序列的集合表征了一个Petri网的运行特征,可用网中可能出现的变迁序列来分析Petri网的性能.Hack[1]和Peterson[2]最早从事这方面的研究.
The language characters of a class of Petri nets in which arbitrary transition! is satisfied with |'t|≤1 and | t'|≤1 are studied in this paper. Because the structures of this class of Petri nets are simple, the language expressions of them are described by a regular expression or an α-closure of a regular expression.
出处
《计算机科学》
CSCD
北大核心
2002年第5期120-122,共3页
Computer Science
基金
国家自然科学基金(69873029)
