极小信标计算及其可控性条件研究

项目名称： 极小信标计算及其可控性条件研究

项目编号： No.61472361

项目类型： 面上项目

立项/批准年度： 2015

项目学科： 自动化技术、计算机技术

项目作者： 王寿光

作者单位： 浙江工商大学

项目金额： 83万元

中文摘要： 目前，信标控制法是基于Petri网的死锁控制策略研究的热点和难点。信标控制法中最重要的两个问题是极小信标的计算和它的可控性条件。极小信标的计算是死锁预防控制策略研究的首要任务，其计算的复杂性决定该死锁控制策略的复杂性，因此极小信标的有效计算至关重要。对信标可控性条件的研究，实际上是为了解决控制器的结构复杂性问题和受控网行为许可性问题，是死锁控制的理论成果能否应用于实际的首要前提。本项目针对上述两大问题展开研究：1）基于问题分解法，研究一般Petri网中极小信标的快速计算方法；2）针对一般Petri网及其弧权值大等于1的特定网，研究更完善的信标可控性定义，并在此基础上，提出两个或多个非可控信标的最优控制来保证另一个非可控信标受控的条件。项目研究成果将促进Petri网理论及应用的发展，同时为离散事件系统中死锁问题的解决提供有力的理论及技术支持。

中文关键词： Petri网；离散事件系统；活性

英文摘要： Nowadays, siphon control is one of hotspots and difficulties in the field of research on Petri-net-based deadlock control strategies, and its key problems to be solved include as follows: the computation of minimal siphons and the siphon controllability condition. The former is the primary research task in design of deadlock control strategies since the computational complexity of a strategy depends largely on its method of computing minimal siphons. The latter is an essential precondition for applying deadlock control theory to practice since a strategy based on a well-defined siphon controllability condition can result in a controlled system with low structural complexity and high behavior permissiveness. This proposal intends to solve the above two problems and its specific content is listed as follows: 1) Propose high-efficient enumeration algorithms for minimal siphons in generalized Petri nets based on problem partition; 2) For generalized Petri nets and their subnets, propose better siphon controllability conditions, and then establish a condition under which if two or more siphons are controlled, their resultant siphon is controlled. These research results will promote further development of Petri net theory and its application, and provide powerful theoretical and technical support for the solution of deadlock problems in discrete event systems.

英文关键词： Petri net;Discrete event system;Liveness