位置：成果数据库 > 会议 > 会议详情页
A polynomial-complexity approach to decide the existence of a maximally permissive Petri net supervi
  • 所属机构名称：西安电子科技大学
  • 会议名称：2009 IEEE International Conference on Networking, Sensing and Control, ICNSC 2009
  • 成果类型：会议
  • 会场：Okayama
  • 相关项目：PETRI网的基本信标理论研究
作者： Zhou, MengChu|Li, Zhiwu|
同会议论文项目
PETRI网的基本信标理论研究
期刊论文 51 会议论文 12 获奖 6 著作 2
同项目会议论文
An improved algorithm for supervisor design for FMS using the theory of regions
Computation of Strict Minimal Siphons in a Class of Petri Nets
Hybrid liveness-enforcing method for petri net models of flexible manufacturing systems
Deadlock prevention using divide-and-conquer strategy for WS3PR
Two generalized-petri-net-based strategies for deadlock prevention in resource allocation systems
On the existence of a maximally permissive liveness-enforcing Petri net supervisor for flexible manu
A deadlock prevention approach for a class of time petri nets based on SCG
An optimization approach towards improved petri net monitor design
Deadlock-free control of ratio-enforced automated manufacturing systems with flexible routes and ass
Supervisory controller optimization for deadlock resolution in automated manufacturing systems with
A deadlock prevention policy for FMS using elementary siphons of Petri nets with uncontrollable tran