基于结构无竞争Petri网的DEDS的状态可达性可控性及其控制  

State Reachability,Controllability and the control of DEDS Represented by No-Competing Petri Nets

作　　者：赵正义[1] 宋文忠[1] 

机构地区：[1]东南大学自动化研究所

出　　处：《控制理论与应用》1995年第6期747-751,共5页Control Theory & Applications

摘　　要：本文给出了依靠代数递推计算判断结构无竞争Ｐｅｔｒｉ网的状态可达性的一种方法；提出了动态子网的概念，提高了判断速度；研究了结构无竞争Ｐｅｔｒｉ网的可达状态控制问题。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.

关 键 词：DEDS PETRI网 状态可达性 状态可控性 控制理论 

分 类 号：O231[理学—运筹学与控制论] TP393[理学—数学]