FAILURE ANALYSIS FOR AN AIRBAG INFLATOR BY PETRI NETS

Petri nets are useful for modelling a variety of asynchronous and concurrent systems, such as automated manufacturing, computer fault tolerant systems, and communication networks. This study employs an airbag inflator system as an example to demonstrate a Petri net approach to failure analysis. This paper uses Petri nets to study minimum cut sets finding, marking transfer, and dynamic behaviour of system failure. For Petri net models incorporating sensors, fault detection and higher-level fault avoidance is dealt with. Compared with fault trees that present only static logic relations between events, Petri nets indeed offer more capabilities in the scope of failure analysis. © 1997 John Wiley & Sons, Ltd.     

The application of Petri nets to failure analysis

Unlike the technique of fault tree analysis that has been widely applied to system failure analysis in reliability engineering, this study presents a Petri net approach to failure analysis. It is essentially a graphical method for describing relations between conditions and events. The use of Petri nets in failure analysis enables to replace logic gate functions in fault trees, efficiently obtain minimal cut sets, and absorb models. It is demonstrated that for failure analysis Petri nets are more efficient than fault trees. In addition, this study devises an alternative; namely, a trapezoidal graph method in order to account for failure scenarios. Examples validate this novel method in dealing with failure analysis.     

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-net based applications for supply chain management: an overview

Supply networks are discrete event dynamic systems consisting of suppliers, manufacturers, distributors, and customers. It is a difficult and challenging task to model such a complex system. Recently, characterised as being capable of model parallelism and synchronisation, Petri nets (PNs) have attracted great attention for modelling and studying a supply network. Since each type of Petri net has its unique properties to model specific applications, this paper reviews and classifies Petri net applications for supply chain management (SCM). According to the decision problems facing SCM, we have the Petri net applications classified into three areas: competitive strategy, firm focused tactics, and operational efficiency. Categorising the Petri net applications will provide a guideline to industry practitioners and research academics to choose the appropriate Petri net for the problem. In addition, the paper attempts to offer future directions in applying the Petri net to SCM including: (1) modelling with uncertainty elements; (2) addressing the scalability issue of Petri nets; (3) integrating Petri nets with other tools; and (4) extending Petri nets to emerging applications.     

A Petri Net Approach to Remote Diagnosis for Failures of Cardiac Pacemakers

This paper describes the application of Petri nets to remote diagnosis for failures of cardiac pacemakers. The operations, structures and basic control methods of the different types of cardiac pacemakers are first described. A combined synchronous pacemaker is modeled into a Petri net in this study. Twelve checkpoints are added into the modeled Petri net so as to construct a Petri net for failure diagnosis. A remote mode for failure diagnosis of implanted pacemakers is also designed by the Petri net approach. A low‐power transmitter transmits a checking‐code with 12 digits from the implanted pacemaker to the outside of the patient's body manually or automatically. By observing the markings of the checking code, the working status and the health condition of the pacemaker are clear at a glance. Applications of the Petri net method for failure diagnosis and control optimization are discussed. Copyright © 2004 John Wiley & Sons, Ltd.     

A transformation from a Boolean equation control specification to a Petri net

In this article we present an algorithm to transform a set(s) of Boolean equations into a Petri net(s). Boolean logic provides a mathematical basis for switching control and many other areas. In the case of programmable logic controllers used for the sequential control in manufacturing applications, Boolean equations are fundamental both in programming and in understanding their operation. A major difficulty with Boolean equations is the lack of any type of mathematical theory for the analysis of the systems that are being represented by these equations. Petri nets, on the other hand, possess a mathematical framework to analyze the properties of the system being modeled. Furthermore, Petri nets have been proved to be appropriate models for sequential control. The popularity as well as the generality of Boolean logic, on one hand, and the modeling and analytical capabilities of Petri nets, on the other hand, are the major motivations for this research.     

Reliability analysis of discrete event dynamic systems with Petri nets

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.     

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

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

应用Petri网改进基于故障树的诊断方法

故障树是表示故障发生和故障传播关系的一种逻辑模型,基于故障树诊断方法的广泛应用由于实际故障树分析过程的ＮＰ困难问题而受到妨碍。而Ｐｅｔｉｒ网是一种特殊的有向网,适合于描述故障的传播关系。本文提出了两种基于Ｐｅｔｒｉ网的改进方法,与下行法相比,用该方法寻找最小割集和最小路集能有效地节省上计算时间,提高推理速度和效率;最后还应用Ｐｉｔｒｉ网的状态方程分析方法提出了基于Ｐｅｔｒｉ网的故障监测和诊断方法。     

PN PLC: A methodology for designing,simulating and coding PLC based control systems using Petri nets

Flexible manufacturing cells (FMCs) are well established as a means of improving manufacturing efficiency in many batch production industries. They consist of an integrated group of computer numerically controlled (CNC) machine tools, programmable logic controller (PLC) based work/tool handling equipment and a control system to synchronize their operation. The safe and reliable operation of FMCs is clearly essential for their efficient use. However, FMCs are complex systems with elements that operate concurrently and interact at irregular times, depending upon the components to be produced. This inherent complexity demands intricate and sophisticated control systems which require development methodologies that are both comprehensive and rigorous. In this paper the authors introduce a methodology (PN PLC) which uses Petri nets for producing correct programmable logic controller (PLC) programs directly from the specifications. The methodology is specifically contrasted with the benefits, and problems, encountered in using tools such as 'ladder diagrams' (LDs) and 'sequential function charts' (SFCs) for designing logical control systems. PN PLC has advantages over ladder logic in clarity, which allows the program to be checked, maintained and updated reliably. Furthermore, the Petri net graph is a one-to-one equivalent of a ladder logic diagram, and thus either representation may be algorithmically translated to the other without loss of information. Finally, the rules for creating Petri net graphs, and subsequently translating them, are both simple and robust in use.     

Sensor-based stage Petri net modelling of PLC logic programs for discrete-event control design

Petri nets have been extensively applied for specification, design, verification, performance evaluation, and simulation of discrete event control systems (DECS). The usual way to verify the dynamic behaviour of DECS design is to employ a process-based model, which proves to be impractical in application because the process-based model does not usually fully correspond to the control programming behaviour. This paper proposes a sensor-based stage Petri net (SBSPN) to represent a programmable logic controller (PLC) stage logic diagram (LD) for discrete-event control design. The new technique is able to simplify the modelling process of the complex PLC program without considering the interlocking problem within the ladder diagram. An illustrated example is used to explore the new methodology. The proposed method contains the power and flexibility of the Petri net analysis prior to the PLC implementation. It is believed that this technique is significant for industry practice.     

Assembly/disassembly task planning and simulation using expert Petri nets

Automatic assembly/disassembly planning is recognized as an important tool for reducing the manufacturing costs in concurrent product and process development. This paper developed a knowledge-based expert Petri net model by incorporating expert system techniques in artificial intelligence into ordinary Petri nets for an analytical framework of understanding, representing and reasoning the assembly/disassembly tasks. Substantial extensions have been made to ordinary Petri nets by adding control places, time constraints, and place and transition knowledge annotations. The proposed expert Petri net model can be considered as the hybrid of expert systems and ordinary Petri nets. Through these extensions, the capacities of modelling and representation of ordinary Petri net models are largely enhanced, and thus the expert Petri net models are more powerful than ordinary Petri nets. Such intelligent Petri net models can combine the abilities of modelling, planning, and performance evaluation for assembly/disassembly tasks in an integrated and intuitive way, and can therefore be applied to either linear/non-linear, static/dynamic, or on-line/off-line assembly/disassembly tasks at both high and low levels. The developed assembly/disassembly planning system can generate the best strategies and plans for assembly/disassembly. The research findings are exemplified with a real assembly to show the effectiveness of the method.     

Nested coloured timed Petri nets for production configuration of product families

Production configuration is as an effective technique to deal with product variety while maintaining production stability and efficiency. It involves a diverse set of process elements (e.g., machines, operations), a high variety of component parts and assemblies and many constraints arising from product and process variety. Production configuration entails the selection and subsequent arrangement of process elements into complete production processes and the final evaluation of configured multiple alternatives. To better understand production configuration and its implementation, we study the underlying logic for configuring production processes using a dynamic modelling and visualisation approach. This is accomplished by developing a new formalism of nested coloured timed Petri nets (PNs). In view of the inherent modelling difficulties, in the formalism three types of nets–process nets, assembly nets and manufacturing nets–together with a nested net system are defined. Using an industrial example of vibration motors, we show how the proposed formalism can be applied to specify production processes at different levels of abstraction to achieve production configuration.     

Petri net based scheduling

Timed Petri nets can be used to model and analyse scheduling problems. To support the modelling of scheduling problems, we provide a method to map tasks, resources and constraints onto a timed Petri net. By mapping scheduling problems onto Petri nets, we are able to use standard Petri net theory. In this paper we will show that we can use Petri net based tools and techniques to find conflicting and redundant precedences, upper- and lower-bounds for the makespan, etc. This is illustrated by a Petri net based analysis of the notorious 10×10 problem due to Fisher & Thompson (1963)     

分布式FMS智能调度和控制系统的研究与开发

介绍了分布式ＦＭＳ智能调度和控制系统的研究与开发情况：提出了一种新的适合于分布式系统建模的网络计时Ｐｅｔｒｉ网ＮＴＰＮ；将ＮＴＰＮ模型与专家系统技术相结合，为系统控制器开发了基于工程的专家系统ＥＢＥＳ；利用面向对象的技术开发了仿真的对象类库，并实现了从仿真到控制的软件重用。     

Modular Petri nets for simulation of flexible production systems

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     

通用型绝对式编码器信号处理电路的开发

绝对式编码器在自动化领域广泛使用,本文以FPGA为核心芯片,完成了一款通用型绝对式编码器信号处理电路.本文论证并确定了所开发电路应具备的通用性功能;对电路系统分别进行了FPGA外围电路设计和FPGA内部硬件逻辑设计,并对FPGA硬件逻辑功能进行了综合仿真;通过搭建的测试平台及编写的PC机软件,使用了两种接口的编码器对电路功能进行了测试,验证了设计方案的可行性.     

Decomposition in automatic generation of Petri nets for manufacturing system control and scheduling

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.