摘要
本文给出了依靠代数递推计算判断结构无竞争Ｐｅｔｒｉ网的状态可达性的一种方法；提出了动态子网的概念，提高了判断速度；研究了结构无竞争Ｐｅｔｒｉ网的可达状态控制问题。
A deterministic way which depends on algebraic recursive computations is developed to judge the state reachability for no-competing Petri Nets. The idea of dynamic subnets is Proposed to make the judgement faster. The problem of state control is studied and a program to design the control is given.
出处
《控制理论与应用》
EI
CAS
CSCD
北大核心
1995年第6期747-751,共5页
Control Theory & Applications
