一种基于Petri网的网络服务兼容性分析方法

针对目前基于网络服务业务过程执行语言(BPEL)的网络服务合成方法缺乏网络服务的兼容性分析机制,不能保证基于网络服务技术的业务过程正确执行的问题,建立了一种能从形式化的角度描述网络服务的接口交互情况的基于Petri网的多元工作流组合网模型,提出了一种能更快地获得网络服务可用性结果的网络服务兼容性判断算法.最后,提出了基于该算法的原型系统架构.     

Optimisation of block erection scheduling based on a Petri net and discrete PSO

The shipyard block erection system (SBES) is a typical discrete-event dynamic system. To model multiprocessing paths and a concurrent assembly procedure, a timed Petri net (TPN) is proposed. The definition of a Petri net is extended to accord with the real-world SBES organisation. The basic TPN modules are presented to model the corresponding variable structures in the SBES, and then the scheduling model of the whole SBES is easily constructed. A modified discrete particle swarm optimisation (PSO) based on the reachability analysis of Petri nets is developed for scheduling of the SBES. In the proposed algorithm, particles are coded by welding transitions and selecting places of the TPN model, and then the collaboration and competition of particle individuals is simulated by crossover and mutation operators in a genetic algorithm. Numerical simulation suggests that the proposed TPN–PSO scheduler can provide an improvement over the conventional scheduling method. Finally, a case study of the optimisation of a back block erection process is provided to illustrate the effectiveness of the method.     

Scheduling of flexible manufacturing systems based on Petri nets and hybrid heuristic search

This paper proposes and evaluates a hybrid search strategy and its application to flexible manufacturing system (FMS) scheduling in a Petri net framework. Petri nets can concisely model multiple lot sizes for each job, the strict precedence constraint, multiple kinds of resources, and concurrent activities. To cope with the complexities for FMS scheduling, this paper presents a hybrid heuristic search strategy, which combines the heuristic A* strategy with the DF strategy based on the execution of the Petri nets. The search scheme can invoke quicker termination conditions, and the quality of the search result is controllable. To demonstrate this, the scheduling results are derived and evaluated through a simple FMS with multiple lot sizes for each job. The algorithm is also applied to a set of randomly generated more complex FMSs with such characteristics as limited buffer sizes, multiple resources, and alternative routings.     

Transient inter-production scheduling based on Petri nets and constraint programming

In this article, we focus on the transient inter-production scheduling problem between two cyclic productions in the framework of flexible manufacturing systems. This problem is first formulated as a reachability problem in timed Petri nets (TPN), then solved using a methodology based on constraint programming. Our work is based on the controlled executions proposed by Chretienne to model the sequence of transition firing dates. Our methodology is based on a preliminary resolution of the state equation between initial and final states in the underlying non-TPN. Then, we choose a duration T _max corresponding to the maximal duration time of the scheduling. For each solution S of the state equation, we build a controlled execution from the sequence of firings in S. After the propagation of firing date constraints and reachability constraints in the TPN, we use constraint programming to enumerate the set of feasible controlled executions.     

Coloured Petri net‐based modeling for distributed relational database queries

Abstract

In this paper, a new application of colour timed Petri net (CTPN) based methodology for distributed relational database queries modeling and corresponding simulation is addressed. This work, first based on parsed query definitions, converts logical query plans into designed CTPN models. Later, the improved cost‐based functions are then established and appended to CTPN with a general purpose CPN simulator‐Design/CPN to observe the thresholds of query operations. The propose CTPN can be used in the design phase as an experimental prototype to automatically simulate distributed database query processing which, in turn, may considerably reduce the load of developing the actual query processing software in the logical design phase of a distributed database system. Also, since all the essential details of query processing in CTPN have been simulated, the results of this study can be closely related to real world applications.     

A coloured Petri net-based hybrid heuristic search approach to simultaneous scheduling of machines and automated guided vehicles

To achieve a significant improvement in the overall performance of a flexible manufacturing system, the scheduling process must consider the interdependencies that exist between the machining and transport systems. However, most works have addressed the scheduling problem as two independent decision making problems, assuming sufficient capacity in the transport system. In this paper, we study the simultaneous scheduling (SS) problem of machines and automated guided vehicles using a timed coloured Petri net (TCPN) approach under two performance objectives; makespan and exit time of the last job. The modelling approach allows the evaluation of all the feasible vehicle assignments as opposed to the traditional dispatching rules and demonstrates the benefits of vehicle-controlled assignments over machine-controlled for certain production scenarios. In contrast with the hierarchical decomposition technique of existing approaches, TCPN is capable of describing the dynamics and evaluating the performance of the SS problem in a single model. Based on TCPN modelling, SS is performed using a hybrid heuristic search algorithm to find optimal or near-optimal schedules by searching through the reachability graph of the TCPN with heuristic functions. Large-sized instances are solved in relatively short computation times, which were a priori unsolvable with conventional search algorithms. The algorithm’s performance is evaluated on a benchmark of 82 test problems. Experimental results indicate that the proposed algorithm performs better than the conventional ones and compares favourably with other approaches.     

A correct minimal siphons extraction algorithm from a maximal unmarked siphon of a Petri net

When using the machine grouping approach for designing cellular manufacturing cells, improper machine assignment commonly arises resulting in higher intercellular movement of parts. The objective of this paper is therefore to examine the cause of such a problem and to propose a workable optimal solution for it. A machine grouping algorithm that is based in the new machine unit concept is developed and the solution is proven to be optimal at each stage. A comparison of the proposed model with two existing algorithms is presented, followed by a discussion on the behaviour of machine cell formation.     

Petri nets and genetic algorithms for complex manufacturing systems scheduling

In this paper we propose the GAPN (genetic algorithms and Petri nets) approach, which combines the modelling power of Petri nets with the optimisation capability of genetic algorithms (GAs) for manufacturing systems scheduling. This approach uses both Petri nets to formulate the scheduling problem and GAs for scheduling. Its primary advantage is its ability to model a wide variety of manufacturing systems with no modifications either in the net structure or in the chromosomal representation. In this paper we tested the performance on both classical scheduling problems and on a real life setting of a manufacturer of car seat covers. In particular, such a manufacturing system involves features such as complex project-like routings, assembly operations, and workstations with unrelated parallel machines. The implementation of the algorithm at the company is also discussed. Experiments show the validity of the proposed approach.     

Real-time deadlock-free scheduling for semiconductor track systems based on colored timed Petri nets

This paper addresses the problem of real-time deadlock-free scheduling for a semiconductor track system. The system is required to process wafers continuously, cassette by cassette. The process is not necessarily a repeated one. In addition, the system is deadlock-prone and its modules are failure-prone. Thus, real-time scheduling approaches are required to achieve high-performance. The problem can be solved in a hierarchical way. A deadlock avoidance policy is developed for the system as a lower-layer controller. With the support of the deadlock avoidance policy, heuristic rules are proposed to schedule the system in real-time. An effective modeling tool, colored–timed resource-oriented Petri net, is presented. It is shown that with this model we can schedule a system to achieve satisfactory results in real-time. This method is tolerant to module failures.     

Scheduling manufacturing systems with blocking: a Petri net approach

This paper introduces a Petri net-based approach for scheduling manufacturing systems with blocking. The modelling of the job routings and the resource and blocking constraints is carried out with the Petri net formalism due to their capability of representing dynamic, concurrent discrete-event dynamic systems. In addition Petri nets can detect deadlocks typically found in systems with blocking constraints. The scheduling task is performed with an algorithm that combines the classical A* search with an aggressive node-pruning strategy. Tests were conducted on a variety of manufacturing systems that included classical job shop, flexible job shop and flexible manufacturing scheduling problems. The optimisation criterion was makespan. The experiments show that the algorithm performed well in all types of problems both in terms of solution quality and computing times.     

Deadlock-free genetic scheduling for flexible manufacturing systems using Petri nets and deadlock controllers

In this paper, a new deadlock-free scheduling method based on genetic algorithm and Petri net models of flexible manufacturing systems is proposed. The optimisation criterion is to minimise the makespan. In the proposed genetic scheduling algorithm, a candidate schedule is represented by a chromosome that consists of two sections: route selection and operation sequence. With the support of a deadlock controller, a repairing algorithm is proposed to check the feasibility of each chromosome and fix infeasible chromosomes to feasible ones. A feasible chromosome can be easily decoded to a deadlock-free schedule, which is a sequence of transitions without deadlocks. Different kinds of crossover and mutation operations are performed on two sections of the chromosome, respectively, to improve the performance of the presented algorithm. Computational results show that the proposed algorithm can get better schedules. Furthermore, the proposed scheduling method provides a new approach to evaluate the performance of different deadlock controllers.     

Hybrid Petri net and digraph approach for deadlock prevention in automated manufacturing systems

This paper proposes a hybrid approach to deadlock prevention in automated manufacturing systems that combines Petri nets (PNs) and digraphs, so taking advantage of the strong points of both techniques. The approach uses digraphs to make the detection of deadlock conditions easier and then translates the obtained information in empty siphons of the PN modelling the same system. The proposed methodology allows the implementation of new PN‐based deadlock prevention control policies. A case study and the simulation results show the benefits of the new control strategies.     

Using genetic algorithms (GA) and a coloured timed Petri net (CTPN) for modelling the optimization-based schedule generator of a generic production scheduling system

The semiconductor manufacturing industry is one of the most complicated manufacturing systems in the world. Considering its complex problem nature, such as the unrelated parallel machine environment, dynamic job arrival, non-pre-emption, inseparable sequence-dependent set-up time, multiple-resource requirements, general precedence constraint, and job recirculation, this study proposed the optimization-based schedule generator (OptSG) for solving the generalized scheduling problems arising from the semiconductor manufacturing environment. The separation of the problem structure and problem configuration in OptSG contributes to the structural independence, making OptSG robust and convenient in analysis and problem-solving in real settings with changing properties. Meanwhile, an MILP model was proposed as a benchmark to estimate the validity of OptSG. Inseparable sequence-dependent set-up time and multiple-resource requirements that have not been addressed simultaneously in the literature were considered in this model. By using different evaluation criteria, including makespan, total completion time and maximum tardiness, experiments were conducted to compare the solutions of the MILP model, OptSG and dispatching rule-based heuristics (DRBH). The results validated the solution quality of OptSG.     

System Failure Analysis Through Counters of Petri Net Models

Petri nets are a powerful technique widely used in the modeling and analysis of complex manufacturing systems and processes. Due to their capability in modeling the dynamics of the systems, Petri nets have been combined with fault tree analysis techniques to determine the average rate of occurrence of system failures. Current methods in combining Petri nets with fault trees for system failure analysis compute the average rate of occurrence of system failures by tracking the markings of the Petri net models. The limitations of these methods are that tracking the markings of a Petri net represented by a reachability tree can be very complicated as the size of the system grows. Therefore, these methods offer less flexibility in analyzing sequential failures in the system. To overcome the limitations of the current methods in applying Petri nets for system failure assessment, this paper expands and extends the concept of counters used in Petri net simulation to perform the failure and reliability analysis of complex systems. The presented method allows the system failures to be modeled using general Petri nets with inhibitor arcs and loops, which employs fewer variables than existing marking‐based methods and substantially accelerates the computations. It can be applied to real system failure analysis where basic events can have different failure rates. Copyright © 2003 John Wiley & Sons, Ltd.     

基于随机Petri网的铜带拉弯矫直机可用度分析

为了合理确定铜带拉弯矫直机的校验周期,提高其生产效率,确保其矫直精度,根据某铜板带公司拉弯矫直机9个月的维修数据,对拉弯矫直机的失效模式进行随机Petri网建模,将系统失效模式转换成相应的随机Petri网;基于马尔科夫过程对随机Petri网进行瞬态概率求解,并得到该拉弯矫直机失效模式的稳态概率;利用或门对应的随机Petri网模型分析,计算不同校验周期下拉弯矫直机的可用度.综合考虑设备可用度和经济效益,确定了合理的校验周期,为拉弯矫直机的长周期运行提供了依据.     

Use of Petri Nets to Model the Maintenance of Wind Turbines

With large expansion plans for the offshore wind turbine industry, there has never been a greater need for effective operations and maintenance. The two main problems with the current operations and maintenance of an offshore wind turbine are the cost and availability. In this work, a simulation model has been produced of the maintenance process for a wind turbine with the aim of developing a procedure that can be used to optimise the process. This initial model considers three types of maintenance—periodic, conditional and corrective—and also considers the weather in order to determine the accessibility of the turbine. Petri nets have been designed to simulate each type of maintenance and weather conditions. It has been found that Petri nets are a very good method to model the maintenance process because of their dynamic modelling and adaptability and their ability to test optimisation techniques. Because of their versatility, Petri net models are developed for both system hardware and the maintenance processes, and these are combined in an efficient and concise manner. Copyright © 2014 John Wiley & Sons, Ltd.     

Modeling of system reliability Petri nets with aging tokens

The paper addresses the dynamic modeling of degrading and repairable complex systems. Emphasis is placed on the convenience of modeling for the end user, with special attention being paid to the modeling part of a problem, which is considered to be decoupled from the choice of solution algorithms. Depending on the nature of the problem, these solution algorithms can include discrete event simulation or numerical solution of the differential equations that govern underlying stochastic processes. Such modularity allows a focus on the needs of system reliability modeling and tailoring of the modeling formalism accordingly. To this end, several salient features are chosen from the multitude of existing extensions of Petri nets, and a new concept of aging tokens (tokens with memory) is introduced. The resulting framework provides for flexible and transparent graphical modeling with excellent representational power that is particularly suited for system reliability modeling with non-exponentially distributed firing times. The new framework is compared with existing Petri-net approaches and other system reliability modeling techniques such as reliability block diagrams and fault trees. The relative differences are emphasized and illustrated with several examples, including modeling of load sharing, imperfect repair of pooled items, multiphase missions, and damage-tolerant maintenance. Finally, a simple implementation of the framework using discrete event simulation is described.     

Optimal Legal Firing Sequence of Petri Nets Using Linear Programming

Petri nets (PNs) are a reliable graphical and mathematical modeling tool for the formal modeling and validation of systems (W. Reisig, A Primer in Petri Net Design, Springer-Verlag: Berlin, Heidelberg, 1992). Applications of PNs include discrete event dynamic systems (DEDS) that are recognized as being concurrent, asynchronous, distributed, parallel, and/or nondeterministic. It is also a powerful formal method for the analysis of concurrent, embedded, and distributed finite state systems (K. Varpaaniemi, Series A: Research Reports, No. 26, Helsinki University of Technology, Digital Systems Laboratory, Oct. 1993). The reachability analysis of PNs is strategically significant as it captures the dynamic behavior of the system as well as providing efficient verification of the correctness of the model. Few linear programming (LP)-based methods can be found that address the reachability problem, and some of these are suitable for optimal control problems. However, due to an inherent state explosion they are difficult to implement; other methods run easily into deadlock as they lack appropriate mechanisms to avoid the firing of critical transitions (T. Matsumoto and A. Tarek, in Proceedings of the 35th IEEE Conference on Decision and Control, Kobe, Japan, 1996-12, pp. 4459–4468). In this paper an improved and easy to implement method is proposed that combines the Optimality Principle and Linear Programming (OP + LP) techniques to find an Optimal Legal Firing Sequence (OLFS) in PNs. This method can be applied to ordinary PNs with self-loops, avoids deadlocks, and can also be used for general PNs having cycles.     

An improved time line search algorithm for manufacturing decision-making

The coloured Petri net formalism has been recently used to analyse and optimise manufacturing systems making use of the state space (SS) analysis. This approach has great potential for scheduling and production planning purposes when it is properly implemented. In this article, an improved version of the algorithm known as the time line search for optimising the makespan of manufacturing models is presented. The algorithm has been developed for the use in a compact SS of coloured Petri net models in order to analyse the highest possible number of manufacturing configurations for the improvement of the makespan of a production system. The proposed algorithm can be used for the developing of decision support tools in manufacturing or operational decision-making.