具有死锁和陷阱结构的模糊Petri网性态分析

Petri网是一种具有动态特性的建模工具,模糊Petri网是Petri网的一个重要分支,可以有效处理具有不精确的、不确定的复杂因素的系统模型问题。本文在模糊动态Petri网的定义和运行规则基础上,研究了具有死锁和陷阱结构的模糊Petri网系统,通过配置不同的初始标识,分析其动态运行特性,并给出算例分析。     

一类FMS的最佳活Petri网模型的综合

利用Petri网为一类柔性制造系统建模,并讨论避免系统死锁问题.通过Petri网模型的结构分析,证明了系统产生死锁的一个充分必要条件.给出了避免死锁的最佳控制器,它可以通过给系统的Petri网模型增加一些新的位置与相应的弧来实现.从而导出了这类制造系统的最佳活Petri网模型.     

具有多项式时间复杂性的避免制造系统死锁控制策略

基于系统 Petri 网模型, 研究自动制造系统的避免死锁问题. 对不含中心资源的制造系统, 证明了它只包含安全和死锁两类可达状态. 通过一步向前看的方法, 给出了系统多项式时间复杂性的最佳避免死锁策略. 对一般系统定义了一种辅助 Petri 网. 利用辅助网的最佳避免死锁策略, 提出了综合一般制造系统多项式复杂性的避免死锁策略的方法.     

离散制造装配系统的活性控制

首次研究离散制造装配系统的活性控制问题.建立了系统的工件加工过程Petri网模型.通过对系统Petri网模型的结构分析,提出了导致系统死锁的两类元素结构及活性特征.对一类离散制造装配系统提出了避免死锁的Petri网控制器,这类控制器容易实现,对系统的限制小,而且使得受控系统仍具Petri网模型.对一般离散制造装配系统提出了保证系统活性的控制策略.     

分布式锁的Petri网建模及死锁检测

分布式锁管理DLM细化了锁模式的粒度,使得分布式系统具有更高的并发性,但死锁检测等锁的管理过程却更加复杂了,Petri网的应用能很好地解决该问题。为分布式锁建立Petri网模型,通过化简和合成建立系统的Petri网模型,借助Petri网的可达标识图实时检测出分布式系统的死锁状态,并查找死锁进程。     

离散制造装配系统的活性控制1)

首次研究离散制造装配系统的活性控制问题.建立了系统的工件加工过程Petri网模型.通过对系统Petri网模型的结构分析,提出了导致系统死锁的两类元素结构及活性特征.对一类离散制造装配系统提出了避免死锁的Petri网控制器,这类控制器容易实现,对系统的限制小,而且使得受控系统仍具Petri网模型.对一般离散制造装配系统提出了保证系统活性的控制策略.     

基于Petri网的数据库系统并发控制活性分析

从数据库系统在时刻t的状态N出发,构造出相应的Petri网模型,进而构造出其可达标识图。通过分析可达标识图,可判断系统是否为死锁状态。若不是死锁状态,系统是否可能出现死锁,什么情况下系统肯定不会出现死锁。最后,给出了数据库系统中事务并发操作的死锁检测方法与避免措施。     

基于Petri网的并发系统活性分析

本文从数据库系统在时刻t的状态N出发，构造出相应的Petri网模型，进而构造出其可达标识图．通过分析可达标识图，可判断系统是否为死锁状态．若不是死锁状态，系统是否可能出现死锁，什么情况下系统肯定不会出现死锁．最后，给出了数据库系统中事务并发操作的死锁检测方法与避免措施．     

基于Petri网模型的FMS死锁结构

死锁是柔性制造系统中容易发生的异常现象,如不加以消除,将会导致整个系统的瘫痪.文中通过Petri网模型对FMS的结构分析,揭示出导致FMS死锁的结构元素和活性特征,在此基础上,提出了FMS的无死锁Petri网控制器算法,并举例说明这种控制器算法在FMS中的应用.     

标注Petri网中的最小初始标识估计

为获得制造系统初始化时的最小资源以实现最优资源分配,利用标注Petri网对系统进行建模,并研究标注Petri网的最小初始标识估计问题。给定一个标注Petri网,在不可观测变迁组成无环子网的情况下,基于动态规划提出一种新的最小初始标识估计算法。在观察到给定的标注序列后,放宽不可观测变迁发生个数的限制,并根据该算法构建节点的演化过程。当出现相同的发生数向量时,仅保留当前极小的初始标识估计,并通过节点的演化过程对极小初始标识估计的托肯总数进行对比。为验证算法的有效性,给出一个制造系统的标注Petri网模型实例,最终得到的最小初始标识为［1000］^T,且对应的变迁发生序列为t₁t₃t₄t₆,满足给定标注Petri网的结构要求。实验结果表明,与传统基于动态规划的算法相比,该算法获得的最小初始标识估计具有更小的托肯总数。     

连续Petri网的死锁和陷阱结构性态分析

连续Petri网是用来分析和描述具有连续变量的系统,被证明是有效的建模工具。本文主要讨论连续Petri网死锁和陷阱结构的性质,并结合算例对此进行了说明。     

Liveness Problem of Petri Nets Supervisory Control Theory for Discrete Event Systems

A quite great progress of the supervisory control theory for discrete event systems (DES) has been made in the past nearly twenty years, and now, automata, formal language and Petri nets become the main research tools. This paper focus on the Petri nets based supervisory control theory of DES. Firstly, we review the research results in this field, and claim that there generally exists aproblem in Petri nets based supervisory control theory of DES, that is, the deadlock caused by the controller introduced to enforce the given specification occurs in the closed-loop systems, especiallythe deadlock occurs in the closed-loop system in which the original plant is live. Finally, a possible research direction is presented for the solution of this problem.     

Decentralized supervisory controller design to avoid deadlock in Petri nets

A decentralized supervisory controller design approach, using overlapping decompositions, is proposed for discrete-event systems modelled by Petri nets to avoid deadlock. In this approach, the given original Petri net is first decomposed into overlapping Petri subnets. A controller for each disjoint Petri subnet is then designed. A controller for the expanded Petri net is next obtained by combining these controllers in a certain way. In the final phase, the controller obtained for the expanded Petri net is contracted in a certain way to obtain a controller for the original Petri net. It is proved that this final controller avoids deadlock in the original Petri net.     

井下调度运输的自动调度策略研究

为了提高煤矿井下机车调度效率和实现井下调度系统自动化,基于Petri网理论知识结合实际井下矿场路况建立机车调度Petri网模型,然后对Petri网模型添加限制库所和变迁使其调度过程无死锁,并通过理论证明了该调度模型是无死锁和冲突的,可以指导机车井下运输调度.然后在机车调度规则下针对不同的井下机车调度相关参数,提出了3种...     

自动化仓库输送调度问题的建模与控制研究

基于面向对象着色Petri网模型和时态逻辑方法,对自动化仓库输送系统运行过程的调度问题进行研究。建立了系统的面向对象着色Petri网模型,讨论了该过程的死锁分析问题,给出了系统行为的时态逻辑规范和死锁避免的最大允许反馈控制策略。     

Deadlock avoidance schemes in a distributed robotic system: Petri net modeling and analysis

This article presents a Petri net-based approach to modeling and evaluating four different deadlock avoidance schemes for a distributed robotic system, i.e., a five-robot-five-assembly-line system. Among these four schemes are the conventional, full synchronization, global semaphore, and partial synchronization schemes. To explore such issues as the system performance and control structure complexity, this article conducts detailed Petri net modeling for this system and evaluates performance of the deadlock avoidance schemes using stochastic Petri nets. The interesting results presented include that: (1) any possible system deadlock can seriously degrade the system performance even if effective deadlock resolution techniques are available; (2) conservative use of resources is likely to be the best policy; and (3) higher resource utilization may not necessarily imply higher system production rate in a resource-sharing environment. The related results need to be further explored for the larger resource-sharing discrete event systems. © 1995 John Wiley & Sons, Inc.     

A deadlock prevention approach for flexible manufacturing systems with uncontrollable transitions in their Petri net models

Deadlocks are a highly undesired situation in a fully automated flexible manufacturing system, whose occurrences are tied to the existence of shared resources that are competed by different production processes. In the last two decades, a fair amount of research has been done on deadlock analysis and control for flexible manufacturing systems, leading to a variety of strategies in the literature. Petri nets are a promising mathematical tool to handle deadlock problems in flexible manufacturing systems. However, most deadlock control policies based on a Petri net formalism assume that all the transitions in a plant model are controllable. However, uncontrollability of events are a natural feature in a real‐world production system. This paper proposes a deadlock prevention policy for a class of Petri nets by considering the existence of uncontrollable transitions. Deadlocks are prevented by adding monitors to a plant Petri net model, whose addition does not inhibit the firings of uncontrollable transitions. Linear programming techniques are employed to find transitions to which a monitor points in order that a more permissive liveness‐enforcing Petri net supervisor can be found. A number of manufacturing examples are used to demonstrate the proposed methods. Copyright © 2011 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

An iterative method for synthesizing non-blocking supervisors for a class of generalized Petri nets using mathematical programming

This paper presents a novel and computational deadlock prevention policy for a class of generalized Petri nets, namely G-systems, which allows multiple resource acquisitions and flexible routings with machining, assembly and disassembly operations. In this research, a mixed integer programming (MIP)-based deadlock detection technique is used to find an insufficiently marked minimal siphon from a maximal deadly marked siphon for generalized Petri nets. In addition, two-stage control method is employed for deadlock prevention in Petri net model. Such proposed method is an iterative approach consisting of two stages. The first one is called siphons control, which adds a control place to the original net for each insufficiently marked minimal siphon. The objective is to prevent minimal siphons from being insufficiently marked. The second one, called control-induced siphons control, is to add a control place to the augmented net with its output arcs connecting to source transitions, which assures that there is no new insufficiently marked siphon generated due to the addition of the monitors. Compared with the existing approaches, the proposed deadlock prevention policy can usually lead to a non-blocking supervisor with more permissive behavior and high computational efficiency for a sizeable plant model due to avoiding complete siphon enumeration. Finally, a practical flexible manufacturing system (FMS) example is utilized to illustrate the proposed method.     

柔性制造系统非阻塞监督控制器优化设计

针对一类含有并发执行装配过程的柔性制造系统G-systems,提出一种新的死锁预防策略保证该系统的非阻塞性,即在控制下,受控系统从任意可达状态都可以到达理想状态.首先对Petri网模型中基本信标实施控制,保证了基本信标的最大可控,然后通过线性规划算法求取所有从属信标满足可控性的条件,即获得基本信标的控制深度变量.与现有方法相比,该策略优点在于只需加入少量的控制库所,就可避免不必要的迭代过程;其次是提出控制器输出弧位置优化策略,得到了结构更为简单、许可行为更多的非阻塞Petri网控制器.