首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 0 毫秒
1.
One of the difficulties in modelling dynamic production systems is the representation of changes to the system along time. Coloured Petri nets with changeable structure (CPN-CS) are capable of modelling systems subject to change. However, this is restricted to functionality modelling of the system. In this paper, we extend CPN-CSs into temporized CPN-CS (TCPN-CS). The extension is carried out by associating relevant modelling elements with time parameters and modifying the mechanism for structure change of the CPN-CS model. TCPN-CS makes it possible to model a dynamic production system considering both functionality and performance. A case study is provided to show that TCPN-CS is effective for modelling dynamic production systems.  相似文献   

2.
This paper addresses the deadlock-free scheduling problem in Flexible Manufacturing Systems. An efficient deadlock-free scheduling algorithm was developed, using timed Petri nets, for a class of FMSs called Systems of Sequential Systems with Shared Resources (S 4 R). The algorithm generates a partial reachability graph to find the optimal or near-optimal deadlock-free schedule in terms of the firing sequence of the transitions of the Petri net model. The objective is to minimize the mean flow time (MFT). An efficient truncation technique, based on the siphon concept, has been developed and used to generate the minimum necessary portion of the reachability graph to be searched. It has been shown experimentally that the developed siphon truncation technique enhances the ability to develop deadlock-free schedules of systems with a high number of deadlocks, which cannot be achieved using standard Petri net scheduling approaches. It may be necessary, in some cases, to relax the optimality condition for large FMSs in order to make the search effort reasonable. Hence, a User Control Factor (UCF) was defined and used in the scheduling algorithm. The objective of using the UCF is to achieve an acceptable trade-off between the solution quality and the search effort. Its effect on the MFT and the CPU time has been investigated. Randomly generated examples are used for illustration and comparison. Although the effect of UCF did not affect the mean flow time, it was shown that increasing it reduces the search effort (CPU time) significantly.  相似文献   

3.
In this paper, extended object-oriented Petri nets (EOPNs) are proposed for the effective modelling of semiconductor wafer fabrication systems (SWFSs). To cope with their complexity in terms of the re-entrant process route and the mixed production mode, a special type of transition called main-bus gate is introduced, which may lead each kind of product to undergo every re-entrant processing stage. In addition, the hierarchical approach is also applied to cope with the complexity. An etching area that processes 0.25?µm logic IC products is taken as an illustration to present the detailed modelling procedures by EOPNs, and the resulting model validates that the EOPNs may cope well with complex SWFSs modelling.  相似文献   

4.
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.  相似文献   

5.
This article presents a new algorithm that we have developed to find the minimal cut-sets of a coherent fault tree. The model presented is based on Petri nets. We also show that for a large fault tree, we are faced with the complexity problem. We suggest the use of place fusion as well as a methodology that can allow us to overcome this difficulty.  相似文献   

6.
The use of Petri nets for modelling, analysing and simulating complex distributed production systems meets serious problems when the size of the model grows. Therefore, it would be very useful to decompose a Petri net based model into smaller models linked with one another. The aim of this paper is to suggest and discuss some possible definitions of Modular Petri nets. This is accomplished by introducing the concept of Petri subnet. Two possible definitions are proposed and the meaning and the usefulness with respect to both model definition and model executability for simulation are pointed out. All definitions are given for the basic model of Petri nets. The extension of modularity concepts to high level Petri nets is shown to be possible in the second part of the paper, where an application is illustrated. In particular an algorithm is given which allows automatic composition of subnets into a larger model  相似文献   

7.
To enhance the agility of virtual production systems (VPSs) under today's dynamic and changing manufacturing environment, a self-adaptive dynamic scheduling method based on event-driven is proposed for VPSs in this paper. This method is composed of the mechanisms and algorithm of self-adaptive dynamic scheduling. In the mechanisms, the dynamic events faced by VPSs are determined through users’ inputs or supervisory controllers’ detections, the local effects made on the schedule are analysed according to the dynamic events, and the self-adaptive measures and rules are specified correspondingly. To implement the dynamic scheduling of VPSs under the guidance of self-adaptive rules, a modified heuristic rescheduling algorithm is proposed for affected operations. A case study illustrates that the proposed method can well accomplish the dynamic scheduling of VPSs in a self-adaptive manner.  相似文献   

8.
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.  相似文献   

9.
Research into both increased performance and improvements in dependability of production systems involves maintenance integration, which allows one to protect their availability and their durability. In the case of large manufacturing systems, maintenance integration is essential from conception, and so it involves a particular development concerned with both model complexity and computing time. A modular modelling approach, based on a cellular decomposition of the system, using stochastic Petri nets and Markov chains has been adopted to implement various maintenance strategies in complex production workshops, with the aim of studying their influence on the system dependability and performance.  相似文献   

10.
A common scenario in engineering is that of a system which operates throughout several sequential and distinct periods of time, during which the modes and consequences of failure differ from one another. This type of operation is known as a phased mission, and for the mission to be a success the system must successfully operate throughout all of the phases. Examples include a rocket launch and an aeroplane flight. Component or sub-system failures may occur at any time during the mission, yet not affect the system performance until the phase in which their condition is critical. This may mean that the transition from one phase to the next is a critical event that leads to phase and mission failure, with the root cause being a component failure in a previous phase. A series of phased missions with no maintenance may be considered as a maintenance-free operating period (MFOP). This paper describes the use of a Petri net (PN) to model the reliability of the MFOP and phased missions scenario. The model uses Monte-Carlo simulation to obtain its results, and due to the modelling power of PNs, can consider complexities such as component failure rate interdependencies and mission abandonment. The model operates three different types of PN which interact to provide the overall system reliability modelling. The model is demonstrated and validated by considering two simple examples that can be solved analytically.  相似文献   

11.
12.
Reliability analysis of discrete event dynamic systems with Petri nets   总被引:1,自引:0,他引:1  
This paper deals with dynamic reliability of embedded systems. It presents a method for deriving feared scenarios (which might lead the system to a critical situation) in Petri nets. A classical way to obtain scenarios in Petri nets is to generate the reachability graph. However, for complex systems, it leads to the state space explosion. To avoid this problem, in our approach, Petri net reachability is translated into provability of linear logic sequents. Linear logic bases are introduced and used to formally define scenarios and minimality of scenarios. These definitions allow the method to produce only pertinent scenarios. The steps of the method are described and illustrated through a landing-gear system example.  相似文献   

13.
14.
This paper investigates the different policies and concepts followed in the traffic management of automated guided vehicle (AGV) systems, and develops the controls for automatically eliminating potential vehicle conflicts in an AGV system. The planning of the AGV system is performed in such a way that there are no conflicts or deadlocks for the vehicles using stochastic Petri nets (SPNs). The major effort is devoted to determining the benefits of the tandem AGV control in comparison with the conventional AGV control method. SPNs have been used to model the different designs of flexible manufacturing systems (FMSs) and with different policies for the movement of material, vehicle path control, inventory planning and tool control. The SPN model is solved and the performance of the system can be evaluated. In this study, the effort is directed to model an FMS with two different types of AGV traffic management methods, namely the conventional and tandem AGV control. A SPN program is used which takes the FMS Petri net model as the input and evaluates the different properties of the Petri net. Finally the performance measures are obtained, which helps in evaluating and comparing the two different AGV traffic management methods.  相似文献   

15.
First-order hybrid Petri nets are models that consist of continuous places holding fluid, discrete places containing a non-negative integer number of tokens, and transitions, either discrete or continuous. In the first part of the paper, we provide a framework to describe the overall hybrid net behaviour that combines both time-driven and event-driven dynamics. The resulting model is a linear discrete-time, time-varying state variable model that can be directly used by an efficient simulation tool. In the second part of the paper, we focus on manufacturing systems. Manufacturing systems are discrete-event dynamic systems whose number of reachable states is typically very large, hence approximating fluid models have often been used in this context. We describe the net models of the elementary components of a flexible manufacturing system (machines and buffers) and we show in a final example how these modules can be put together in a bottom-up fashion.  相似文献   

16.
Despite the efforts in developing Petri net models for manufacturing control and scheduling, the generation of Petri net models cannot be automated for agile manufacturing control and scheduling without difficulties. The problems lie in the complexity of Petri net models. First of all, it is difficult to visualize the basic manufacturing process flow in a complex Petri net model even for a Petri net modelling expert. The second problem is related to the complexity of using Petri net models for manufacturing system scheduling. In this paper, a decomposition methodology in automatic generation of Petri nets for manufacturing system control and scheduling is developed. The decomposition methodology includes representing a manufacturing process with the Integrated Definition 3 (IDEF3) methodology, decomposing the manufacturing process based on the similarity of resources, transforming the IDEF3 model into a Petri net control model, and aggregating sub Petri net models. Specifically, a sequential cluster identification algorithm is developed to decompose a manufacturing system represented as an IDEF3 model. The methodology is illustrated with a flexible disassembly cell example. The computational experience shows that the methodology developed in this paper reduces the computational time complexity of the scheduling problem without significantly affecting the solution quality obtained by a simulated annealing scheduling algorithm. The advantages of the methodology developed in this paper include the combined benefits of simplicity of the IDEF3 representation of manufacturing processes and analytical and control properties of Petri net models. The IDEF3 representation of a manufacturing process enhances the manmachine interface.  相似文献   

17.
A methodology is developed which uses Petri nets instead of the fault tree methodology and solves for reliability indices utilising fuzzy Lambda–Tau method. Fuzzy set theory is used for representing the failure rate and repair time instead of the classical (crisp) set theory because fuzzy numbers allow expert opinions, linguistic variables, operating conditions, uncertainty and imprecision in reliability information to be incorporated into the system model. Petri nets are used because unlike the fault tree methodology, the use of Petri nets allows efficient simultaneous generation of minimal cut and path sets.  相似文献   

18.
We investigated the feasibility of using stochastic Petri nets (SPNs) to describe the behaviours of automated storage/retrieval systems as well as to evaluate the performance of different control policies of such systems. SPNs have been studied in the past 2 decades, and have become a powerful tool in modelling concurrent and distributed systems that exhibit synchronization and contention of shared resources. It appeared that some important characteristics of AS/RS could be well modelled with SPNs. The SPN is a graph-based tool suitable for modelling systems (manufacturing, computer, biological, etc.). It can be used to model a system at different levels of abstraction. In this study, the efficiency, control rules, bay assignment, and many other performance issues associated with AS/RS have been studied in detail using SPN models. SPNs are shown to be equivalent to the stochastic processes in which embedded Markov chains can be recognized. In addition, a stochastic Petri net package, SPNP, was adopted to solve the reachability trees from which an embedded Markov chain was generated. Finally, the performance of those systems of our interest was evaluated. The unique features and flexibility of SPNs are presented. Furthermore, the SPN models for different control algorithms of an AS/RS are discussed with examples.  相似文献   

19.
The object in a flexible manufacturing system is optimal system resources scheduling. The production scheduling of such a system may be resolved by a set of individual agents, who can work in parallel and their coordination may bring a more effective way of finding an optimal solution. The criteria for the optimal solution may be created on a time or economical (cost) basis but each may have a different priority depending on each situation. In this paper, we will analyse an approach to find a feasible schedule of all products, which could minimize costs and satisfy all constraints related to each product.  相似文献   

20.
Y. Narahari  N. Viswanadham 《Sadhana》1987,11(1-2):187-208
The fault-tolerant multiprocessor (ftmp) is a bus-based multiprocessor architecture with real-time and fault-tolerance features and is used in critical aerospace applications. A preliminary performance evaluation is of crucial importance in the design of such systems. In this paper, we review stochastic Petri nets (spn) and developspn-based performance models forftmp. These performance models enable efficient computation of important performance measures such as processing power, bus contention, bus utilization, and waiting times.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号