自动制造系统的一种死锁避免策略

基于Petri网的结构分析理论，提出了自动制造系统Petri网模型的一种死锁控制方法，在这种策略的控制下，避免了系统中死锁的产生，从而许多制造系统的Petri网模型具有活性，提出了一种保证所有严格极小信标至少含有一个托肯的方法，对冗余严格极小信标的研究，提高了Petri网复杂自动制造系统的建模能力。结果表明，在设计无死锁的Petri网格型时，不是所有的严格极小信标都要考虑，从而简化了设计结果和控制算法。     

S3PMR网的一种死锁预防优化策略

针对Petri网的S3PMR中的死锁预防问题,提出一种优化的控制器设计方法.当控制器的优化性不能保证时,要对所添加的控制器进行结构分析,提出了一个输出弧位置最优化的死锁预防控制算法.将S3PMR中的严格极小信标分为基本信标和从属信标,对每一个基本信标添加一个控制库所,使其P-不变式可控,且不会产生新的可被清空信标,对从属信标的控制则通过调整基本信标的控制深度变量来实现.从而用少量的控制库所得到结构更简单、许可行为更多的活性Petri网控制器.     

自动制造系统中的迭代式死锁预防策略

为解决自动制造系统中的死锁问题,提出一种将混合整数规划算法和Petri网相结合的迭代式预防策略。在该策略中,混合整数规划算法中的0／1变量用来表示Petri网模型中的库所和变迁是否与一个最大的可被清空的信标相关。由于从一个最大的可被清空的信标中可以容易地计算出一个严格极小信标,就可以在不遍历所有的严格极小信标的情况下,直接求得一组基本信标,从而大大地降低了策略的时间算法复杂度。同时,控制该组基本信标可以确保目标系统具有简单的控制器结构和尽可能多的许可行为。实验结果表明了该控制策略的有效性和高效性。     

S3PR网的一种最大许可活性监督控制器设计方法

针对S3PR网的死锁预防问题,提出一种基于信标的最大许可死锁控制策略.采用迭代方法对网系统中存在的所有可清空严格极小信标添加一组广义互斥约束,使信标的标志数不超过某个上限值,将基于信标的死锁预防控制转化为禁止状态监控问题,使得受控网系统的所有禁止状态不可达,从而保证受控网具有最大许可行为.通过柔性制造系统实例验证了该策略的有效性,该算法尤其适用于结构相对简单的可达状态性能要求比较高的网模型.     

柔性制造系统一种次优化的死锁控制设计

为解决柔性制造系统中的死锁问题,以受控系统的许可行为作为指标,根据Petri网基本信标理论,提出了一种次优化的活性控制器设计方法.根据基本信标和从属信标的可控性关系,通过调整控制库所的初始标志,获得了具有较多许可行为的活性Petri网控制器.与文献中其他方法相比,所提的控制策略具有更好的许可性.     

复杂并行共享资源与系统死锁

研究了制造过程共享资源引起的死锁问题。提出了并行资源死锁结构的概念。对于包含该结构的系统，给出了Petri网模型具有可能死锁的充要条件。基于资源向量的概念，提出了一个简单方法，用于判断系统是否具有可能的死锁。针对包含死锁结构的系统，提出了系统Petri网无死锁的设计方法，举例说明了这种方法的应用。     

复杂并行共享资源柔性制造系统中的死锁结构

深入研究了独立制造过程共享资源引起的死锁问题 ,提出了并行资源死锁结构的概念。同时 ,基于资源向量 ,给出了一种简单的形式化方法 ,用于判断一个系统是否由于包含并行共享而具有可能的死锁 ,提出了一种使并行共享资源制造系统 ,其 Petri网控制器无死锁的设计理论和方法 ,这种方法的主要特点是计算简单 ,最后举例说明了这种方法的应用。     

自动小车存取系统中轨道导引小车环路死锁控制的研究

为防止自动小车存取系统中轨道导引小车环路死锁现象,提出了一种基于Petri网和有向图的死锁控制方法.该方法首先应用有色赋时Petri网建立了自动小车存取系统的动态模型,并结合有向图工具,阐述了导致环路死锁的原因.在此基础上,针对单一轨道双向运行的轨道导引系统,探讨了其环路死锁的主要表现形式,给出了轨道导引小车无死锁运行的充要条件,并提出了包含临界状态在内的死锁避免控制策略.最后,结合实例说明了环路死锁控制的有效性.     

一种基于Petri网和AGA算法的测试系统死锁预防策略

在自动测试系统中,很多任务需要并行测试.测试过程比串行测试复杂,较容易出现死锁现象,因此提出一种基于Petri网和自适应遗传算法(adaptive genetic algorithm)的死锁预防策略.在该策略中,首先为自动测试系统建立一个Petri网模型,然后将Petri网的状态方程作为约束条件,最后求出模型的发射序列即系统中无死锁的任务调度路径.Petri网的发射序列求解一直是NP问题,针对这种情况,引入自适应遗传算法对可行解空间进行全面的搜索,可得到所有无死锁的路径.最后,通过雷达接收机的并行测试例子,和启发式算法搜索进行对比,进一步体现了该死锁预防策略的优越性.     

多资源服务处理系统的活性控制策略

为解决一类具有多资源服务处理制造系统中的死锁问题,提出了利用Petri网描述系统结构和动态特征的方法,以及循环结构的新概念,证明了循环结构是导致系统死锁的惟一结构特征。利用辅助系统Petri网模型,提出了计算系统的所有基本极大循环结构的方法。对每个基本极大循环结构增加一个控制位置及其相关弧以限制其资源的利用,从而有效地避免系统死锁的发生。     

Design of deadlock prevention supervisors using Petri nets

This paper proposes a methodology to synthesize supervisors for a class of sequential resource allocation system for flexible manufacturing systems. The type of Petri nets are called S3PR, where deadlocks are related to emptied siphons. In a former paper (Huang et al., IEEE Trans Syst Man Cybern, 2007), a deadlock prevention policy was proposed based on Petri nets siphons for the type of Petri nets. Since all minimal siphons should be controlled, the deadlock prevention policy is very time-consuming when the system is large. In this research, a concept of the elementary siphon is used to reduce the number of control places. A new siphon-based policy of deadlock prevention for the type of Petri nets is presented. This policy consists of two main stages: The first stage, called elementary siphons control, adds control places to the original net model to prevent elementary siphons from being emptied. The second stage, called generalized siphons control, adds control places that adopt a conservative policy of controlling only the release of parts into the system are used. Compared to the existing approaches, the new deadlock prevention policy can obtain a structurally compact deadlock prevention supervisor by adding only a few control places. Finally, numerical experiments under reachable states illustrate that the proposed algorithm appears to be more permissive than the closely related approaches.     

An optimal-elementary-siphons-based iterative deadlock prevention policy for flexible manufacturing systems

Petri nets have been proved to be a tool with prominent capabilities to describe discrete event systems, such as flexible manufacturing systems (FMS), thanks to their excellent properties over other models. Characterization in terms of special structural elements in a Petri net called siphons has been a major approach for the investigation of deadlock-freeness in context of FMS. Utilizing the optimal elementary siphons and the modified mixed integer programming (MIP) algorithm proposed in this paper, one can detect and solve deadlock problems arising in FMS in an iterative mode with tractable computational complexity. Moreover, the MIP approach can be exploited to implement the flexibility enhancement in the resultant net system so that the obtained system is less restricted. In contrast to the conventional typical policies, this approach evolves without explicitly enumerating all the strict minimal siphons. Its legitimacy and feasibility are proved and validated through an experimental study.     

Deadlock control of concurrent manufacturing processes sharing finite resources

A novel deadlock control policy is developed for modeling the concurrent execution of manufacturing processes with limited shared resources through a class of nets, ES³PR. A relevant property of the system behavior is that it is deadlock-free. Recent work has shown that deadlock situations in a plant system can be easily characterized by the structural analysis of the system, particularly, in terms of unmarked or insufficiently marked siphons in its Petri net model. The strict minimal siphons in a plant ES³PR net model are divided into elementary and dependent ones. The proposed deadlock prevention policy is to make all siphons satisfy maximal cs-property when the elementary siphons in the plant Petri net model are properly supervised via explicitly adding monitors for them with appropriate initial markings. Compared with the existing approaches in the literature, the advantage of the policy is that a much smaller number of supervisory places (monitors) are added and unnecessary iterative processes are avoided. Finally, its application is illustrated by a flexible manufacturing example.     

Deadlock prevention and avoidance in FMS: A Petri net based approach

The use of structure theory of Petri nets to develop efficient deadlock prevention and deadlock avoidance methods for flexible manufacturing systems (FMSs) modelled by S⁴R nets is demonstrated. Major synchronisation patterns, such as generalised parallel and sequential mutual exclusion, frequently observed in FMS contexts can be represented by this class. The liveness property of a given S⁴R net (deadlock-freeness in the context of FMSs) is characterised in terms of structural Petri net elements called siphons. An efficient method for controlling minimal siphons of a given S⁴R net is developed where local control places are added to the net. A sufficient condition for liveness of the augmented net is provided. This constitutes a deadlock prevention approach. When the net liveness condition is not satisfied, an on-line controller, using a dynamic resource allocation policy, is developed for the augmented net. The performance of the proposed approaches is illustrated using several examples.     

Deadlock control of flexible manufacturing systems via invariant–controlled elementary siphons of petri nets

Effective resolution for deadlock problems plays an important role in the operation of automated flexible manufacturing systems (FMS). Based on P-invariants and elementary siphons of Petri nets, a deadlock prevention policy is developed for a special class of Petri nets that can well model many FMS. Siphons in a plant net model are divided into elementary and dependent ones. For each elementary siphon, a monitor is added to the plant model such that the siphon is invariant-controlled. Our method guarantees that no emptiable control-induced siphon is generated due to the addition of the monitors. When all elementary siphons are controlled, the controllability of a dependent siphon is ensured by properly setting the control depth variables of its related elementary siphons. An FMS example is utilized to illustrate the proposed methods.     

Efficient deadlock prevention policy in automated manufacturing systems using exhausted resources

To design supervisors enforcing liveness of automated manufacturing systems (AMS), an efficient deadlock prevention policy based on the exhausted resources is proposed. This policy exploits a special structure of Petri nets in the sense that the liveness of a specific system can be guaranteed if no shared resource can be emptied. In contrast to the typical conventional policies, the explicit enumeration of either the reachable states or the siphons can be avoided. Experimental results verify the efficient implementation of the proposed policy.     

Building AGV traffic-control models with place-transition nets

Owing to the lack of robust design and control algorithms, most current applications of automated guided vehicle systems (AGVSs) employ simple control methods despite the fact that the system is far from efficient. Recently, Petri nets have evolved into a powerful tool for modelling complex manufacturing systems. One of the advantages of the use of Petri nets is that analysis, simulation and on-line control can all be done on the same model once the model is built. The purpose of this paper is to establish the research fundamentals in the field of the Petri-net modelling of an AGVS. The main contribution of the paper is to define basic traffic-control nets which can be used directly to model an AGVS without too much thinking. Some basic AGV Petri-net control elements are described and illustrated in detail. Also, difficulties in the use of bidirectional flows are discussed, and it has been determined how Petri nets can be used to solve these problems.     

Discrete event control system design using automation Petri nets and their ladder diagram implementation

As automated manufacturing systems become more complex, the need for an effective design tool to produce both high-level discrete event control systems (DECS) and low-level implementations becomes more important. Petri nets represent the most effective method for both the design and implementation of DECSs. In this paper, automation Petri nets (APN) are introduced to provide a new method for the design and implementation of DECSs. The APN is particularly well suited to multiproduct systems and provides a more effective solution than Grafcet in this context. Since ordinary Petri nets do not deal with sensors and actuators of DECSs, the Petri net concepts are extended, by including actions and sensor readings as formal structures within the APN. Moreover, enabling and inhibitor arcs, which can enable or disable transitions through the use of leading-edge, falling-edge and level of markings, are also introduced. In this paper, the methodology is explained by considering a fundamental APN structure. The conversion of APNs into the IEC1131-3 ladder diagrams (LD) for implementation on a PLC is also explained by using the token passing logic (TPL) concept. Finally, an illustrative example of how APNs can be applied to a discrete manufacturing problem is described in detail.