Structural Complexity Analysis of Information Systems Based on Petri Nets

Aim To present a quantitative method for structural complexity analysis and evaluation of information systems. Methods Based on Petri net modeling and analysis techniques and with the aid of mathematical tools in general net theory(GNT), a quantitative method for structure description and analysis of information systems was introduced. Results The structural complexity index and two related factors, i.e. element complexity factor and connection complexity factor were defined, and the relations between them and the parameters of the Petri net based model of the system were derived. Application example was presented. Conclusion The proposed method provides a theoretical basis for quantitative analysis and evaluation of the structural complexity and can be applied in the general planning and design processes of the information systems.

Modeling method of hybrid systems using extended Petrinets

In order to model effectively hybrid systems,a new modeling method of extended Petri nets,which is called extended object-orient hybrid Petri net （EOHPN）,is proposed.To deal with the complexity of hybrid systems, object-oriented abstraction mechanisms such as encapsulation and classifications are merged into EOHPN models.To combine the continuous part and discrete part of hybrid systems and to reduce the complexity of hybrid systems,a hybrid Petri net is introduced and extended with object-oriented modeling technology.Development of object models is suggested on the basis of the defined EOHPN.Finally, an application-oriented case is presented to illustrate that how the proposed EOHPN is used to model hybrid systems.The resulting model validates that the EOHPNs can deal with the modeling complexity of hybrid systems.

Optimal deadlock avoidance Petri net supervisors for automated manufacturing systems

Deadlock avoidance problems are investigated for automated manufacturing systems with flexible routings. Based on the Petri net models of the systems, this paper proposes, for the first time, the concept of perfect maximal resourcetransition circuits and their saturated states. The concept facilitates the development of system liveness characterization and deadlock avoidance Petri net supervisors. Deadlock is characterized as some perfect maximal resource-transition circuits reaching their saturated states. For a large class of manufacturing systems, which do not contain center resources, the optimal deadlock avoidance Petri net supervisors are presented. For a general manufacturing system, a method is proposed for reducing the system Petri net model so that the reduced model does not contain center resources and, hence, has optimal deadlock avoidance Petri net supervisor. The controlled reduced Petri net model can then be used as the liveness supervisor of the system.

A Simulation Engine for Stochastic Timed Petri Nets and Application to Emergency Healthcare Systems

In many service delivery systems,the quantity of available resources is often a decisive factor of service quality.Resources can be personnel,offices,devices,supplies,and so on,depending on the nature of the services a system provides.Although service computing has been an active research topic for decades,general approaches that assess the impact of resource provisioning on service quality matrices in a rigorous way remain to be seen.Petri nets have been a popular formalism for modeling systems exhibiting behaviors of competition and concurrency for almost a half century.Stochastic timed Petri nets(STPN),an extension to regular Petri nets,are a powerful tool for system performance evaluation.However,we did not find any single existing STPN software tool that supports all timed transition firing policies and server types,not to mention resource provisioning and requirement analysis.This paper presents a generic and resource oriented STPN simulation engine that provides all critical features necessary for the analysis of service delivery system quality vs.resource provisioning.The power of the simulation system is illustrated by an application to emergency health care systems.

Reliability Modeling of Phased Mission System with Phase Backup by Stochastic Petri Net

This paper presents a modeling method by stochastic Petri net for reliability analysis of phased mission system( PMS) with phase backup. The model consisting of petri nets,depicts the system behaviors of unit level,system logic level and phase level. Guard functions of petri nets are used to avoid modeling complexity and make the model flexible to different reliability logical structures. It was shown that the time redundancy within phase and from phase backup for PMS can both be described by use of the proposed model.

Property Preservation of Petri Synthesis Net Based Representation for Embedded Systems

Embedded systems have numerous applications in everyday life.Petri-net-based representation for embedded systems(PRES+)is an important methodology for the modeling and analysis of these embedded systems.For a large complex embedded system,the state space explosion is a difficult problem for PRES+to model and analyze.The Petri net synthesis method allows one to bypass the state space explosion issue.To solve this problem,as well as model and analyze large complex systems,two synthesis methods for PRES+are presented in this paper.First,the property preservation of the synthesis shared transition set method is investigated.The property preservation of the synthesis shared transition subnet set method is then studied.An abstraction-synthesis-refinement representation method is proposed.Through this representation method,the synthesis shared transition set approach is used to investigate the property preservation of the synthesis shared transition subnet set operation.Under certain conditions,several important properties of these synthetic nets are preserved,namely reachability,timing,functionality,and liveness.An embedded control system model is used as an example to illustrate the effectiveness of these synthesis methods for PRES+.

Novel dynamic evidential Petri net for system reliability analysis

This paper proposes a novel dynamic Petri net (PN) model based on Dempster-Shafer (D-S) evidence theory, and this improved evidential Petri net (EPN) model is used in knowledge inference and reliability analysis of complex mechanical systems. The EPN could take epistemic uncertainty such as interval information, subjective information into account by applying D-S evidence quantification theory. A dynamic representation model is also proposed based on the dynamic operation rules of the EPN model, and an improved artificial bee colony (ABC) algorithm is employed to proceed optimization calculation during the complex systems' learning process. The improved ABC algorithm and D-S evidence theory overcome the disadvantage of extremely subjective in traditional knowledge inference efficiently and thus could improve the accuracy of the EPN learning model. Through a simple numerical case and a satellite driving system analysis, this paper proves the superiority of the EPN and the dynamic knowledge representation method in reliability analysis of complex systems.

STOCHASTIC OBJECT-ORIENTED PETRI NETS (SOPNS) AND ITS APPLICATION IN MODELING OF MANUFACTURING SYSTEM RELIABILITY

Object-oriented Petri nets (OPNs) is extended into stochastic object-oriented Petri nets (SOPNs) by associating the OPN of an object with stochastic transitions and introducing stochastic places. The stochastic transition of the SOPNs of a production resources can be used to model its reliability, while the SOPN of a production resource can describe its performance with reliability considered. The SOPN model of a case production system is built to illustrate the relationship between the system's performances and the failures of individual production resources.

Improved methods for scheduling flexible manufacturing systems based on Petri nets and heuristic search

This paper proposes and evaluates two improved Petri net （PN）-based hybrid search strategies and their applications to flexible manufacturing system （FMS） scheduling. The algorithms proposed in some previous papers, which combine PN simulation capabilities with A＊ heuristic search within the PN reachability graph,may not find an optimum solution even with an admissible heuristic function. To remedy the defects an improved heuristic search strategy is proposed, which adopts a different method for selecting the promising markings and reserves the admissibility of the algorithm. To speed up the search process, another algorithm is also proposed which invokes faster termination conditions and still guarantees that the solution found is optimum. The scheduling results are compared through a simple FMS between our algorithms and the previous methods. They are also applied and evaluated in a set of randomly-generated FMSs with such characteristics as multiple resources and alternative routes.

Hybrid Petri Nets for Modeling and Analysis of Microgrid Systems

Hybrid Petri nets(HPNs) are widely used to describe and analyze various industrial hybrid systems that have both discrete-event and continuous discrete-time behaviors. Recently,many researchers attempt to utilize them to characterize power and energy systems. This work proposes to adopt an HPN to model and analyze a microgrid that consists of green energy sources. A reachability graph for such a model is generated and used to analyze the system properties.

Modeling of photolithography process in semiconductor wafer fabrication systems using extended hybrid Petri nets

To describe a semiconductor wafer fabrication flow availably, a new modeling method of extended hybrid Petri nets （EHPNs） was proposed. To model the discrete part and continuous part of a complex photolithography process, hybrid Petri nets （HPNs） were introduced. To cope with the complexity of a photolithography process, object-oriented methods such as encapsulation and classifications were integrated with HPN models. EHPN definitions were presented on the basis of HPN models and object-oriented methods. Object-oriented hybrid Petri subnet models were developed for each typical physical object and an EHPN modeling procedure steps were structured. To demonstrate the feasibility and validity of the proposed modeling method, a real wafer photolithography case was used to illustrate the modeling procedure. dynamic modeling of a complex photolithography process effectively The modeling results indicate that the EHPNs can deal with the dynamic modeling of a complex photolithography process effectively.

Modeling and Analysis of Logistics System Based on Stochastic Petri Net under Supply Chain Circumstances

In order to describe the impacts of adjustment ability of logistics system on the profit and cost of logistics system, we constructed a model of logistics system based on stochastic Petri net （ SPN）, and proposed a theorem for the adjustment ability of logistics system under supply chain circumstances on condition that the payoff of supply chain is a steadily increasing process. Then we put forward that a sequence of MGF （ moment generating function ） of out-of-goods risk process for logistics system is a martingale. The model we proposed can overcome shortcomings of the previous ones that can not describe the characteristics of the adjustment ability of logistics system. The results of simulation experiments are consistent with theoretical analysis.

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 a problem 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, especially the 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.

MODELING RADIO RESOURCE MANAGEMENT IN COGNITIVE RADIO SYSTEM BASED ON OFDMA USING COLORED PETRI NET

Cognitive Radio(CR) system based on Orthogonal Frequency Division Multiple Access(OFDMA),such as Wireless Regional Area Networks(WRAN) and Worldwide Interoperability for Microwave Access(WiMAX),often attempt to improve performance via dynamic radio resource management,which is characterized as concurrent processing of different traffic and nondeterministic system capacity.It is essential to design and evaluate such complex system using proper modeling and analysis tools.In the previous work,most of the communication systems were modeled as Markov Chain(MC) and Stochastic Petri Nets(SPN),which have the explicit limitation in evaluating adaptive OFDMA CR system with wide area traffic.In this paper,we develop an executable top-down hier-archical Colored Petri Net(CPN) model for adaptive OFDMA CR system,and analyze its performance using CPN tools.The results demonstrate that the CPN can model different radio resource manage-ment algorithms in CR Systems,and the CPN tools require less computational effort than Markov model using Matlab,with its flexibility and adaptability to the traffics which arrival interval and processing time are not exponentially distributed.

Research on Petri Net System Parallel Subnet Partitioning Completeness Theory and Algorithm

In order to solve the parallel algorithm of Petri net system with concurrent function, so as to achieve the parallel control and simulation operation of this system, this paper proposes the function partition completeness theory and algorithms of Petri net parallelization, thereby providing the theoretical support for the realization of Petri parallel algorithms. Firstly, according to the concurrent characteristics of Petri net model, we analyze the parallelism of Petri net system; then, by giving the solving process of place invariants and the function partitioning of Petri net, we propose the function partitioning conditions and determination theorem of Petri net parallelization, and conduct its theoretical proof and practical verification. On this basis, we conduct the theoretical study and analysis on the situation that Petri net system has several kinds of parallel function partitioning, propose the completeness theorem of parallelism function partitioning in Petri net system, and verify it. Finally, we give the algorithms, application examples and simulation experiment results of parallel function partitioning of Petri net systems based on place invariant. The theoretical proof and experimental results show that the function partitioning conditions and completeness theory of Petri net parallelization based on place invariant are correct, and the parallel algorithms under such theoretical basis are also correct and effective.

The Relation between the Stabilization Problem for Discrete Event Systems Modeled with Timed Petri Nets via Lyapunov Methods and Max-Plus Algebra

A discrete event system is a dynamical system whose state evolves in time by the occurrence of events at possibly irregular time intervals. Timed Petri nets are a graphical and mathematical modeling tool applicable to discrete event systems in order to represent its states evolution where the timing at which the state changes is taken into consideration. One of the most important performance issues to be considered in a discrete event system is its stability. Lyapunov theory provides the required tools needed to aboard the stability and stabilization problems for discrete event systems modeled with timed Petri nets whose mathematical model is given in terms of difference equations. By proving stability one guarantees a bound on the discrete event systems state dynamics. When the system is unstable, a sufficient condition to stabilize the system is given. It is shown that it is possible to restrict the discrete event systems state space in such a way that boundedness is achieved. However, the restriction is not numerically precisely known. This inconvenience is overcome by considering a specific recurrence equation, in the max-plus algebra, which is assigned to the timed Petri net graphical model.

THEMODELINGOFATCSYSTEMSBASEDONPETRINET

In this paper a modeling method of ATC system is developed by using object Petri net. The formalized definition of the senior Petri net is given and illustrated by a practical example.

MODELING MULTI-TRAFFIC ADMISSION CONTROL IN OFDMA SYSTEM USING COLORED PETRI NET

Call Admission Control (CAC) is one of the key traffic management mechanisms that must be deployed in order to meet the strict requirements for dependability imposed on the services provided by modern wireless networks. In this paper, we develop an executable top-down hierarchical Colored Petri Net (CPN) model for multi-traffic CAC in Orthogonal Frequency Division Multiple Access (OFDMA) system. By theoretic analysis and CPN simulation, it is demonstrated that the CPN model is isomorphic to Markov Chain (MC) assuming that each data stream follows Poisson distribution and the corresponding arrival time interval is an exponential random variable, and it breaks through MC's explicit limitation, which includes MC's memoryless property and proneness to state space explosion in evaluating CAC process. Moreover, we present four CAC schemes based on CPN model taking into account call-level and packet-level Quality of Service (QoS). The simulation results show that CPN offers significant advantages over MC in modeling CAC strategies and evaluating their performance with less computational complexity in addition to its flexibility and adaptability to different scenarios.

A Method for Modeling the Virtual Instrument Automatic Test System Based on the Petri Net

Virtual instrument is playing the important role in automatic test system. This paper introduces a composition of a virtual instrument automatic test system and takes the VXIbus based a test software platform which is developed by CAT lab of the UESTC as an example. Then a method to model this system based on Petri net is proposed. Through this method, we can analyze the test task scheduling to prevent the deadlock or resources conflict. At last, this paper analyzes the feasibility of this method.

Petri net model for diagnosis of permanent faults of a hydraulic system

Petri net model is applied to diagnose the permanent fault of hydraulic system within the framework of interpreted Petri net. The permanent fault is described as redundant structure of the model. A definition and a theorem are proposed to determine the diagnosability of the hydraulic system. The relations bwtween the diagnosability and other structure properties are also discussed. An example of actual hydraulic system is presented and its permanent fault can be diagnosed by the proposed method efficiently.