Shared P-Type Logic Petri Net Composition and Property Analysis: A Vector Computational Method

Process mining technology can extract process knowledge from event logs that are generated from information systems. It can construct a process model by mining the event logs. The model usually needs to be repaired to accurately describe the business process realized by the information system. The existing methods for repairing process models cannot enhance efficiently some model consistency metrics, such as the fitness, precision, and simplicity. Thus, a new model repair approach is proposed based on an extended Petri net named logic Petri net in this paper. It can improve the model's fitness and precision comparing with the existing work. First, it builds process models via logic Petri nets. Next, approaches are proposed to repair the process models containing a causal relation and a concurrent relation, respectively. Specifically, a precursor set and a successor set of activities are defined and the relation of the elements in each of them is determined. Finally, we give some cases related to a thoracic surgery process in a hospital and conduct experiments to illustrate the correctness and effectiveness of the proposed approach.

Petrinets are the suitable tool for modeling and analysis of discrete event systems. The effective methods of analyzing the discrete event systems (DES) are exhibited by Petri nets. The entire structure of the system is mathematically expressed using Petrinets and also all the properties are analysed by different methods. The properties of Petrinets are different in various systems, a Flexible Manufacturing System (FMS) requires production activities in which raw materials, energy, labour, and equipment are combined together in the modification process for the production of good quality goods.” The word “flexible” explains the capability of the system to relate productively to make changes in the system. These changes can be internal failure of the system or classification problems such as a sample or external changes in the structure of the model as well as demand for the process. The inherent limitations such as undecidable properties, complexity in checking, automatic verification of the modeled system are existing in FMS. This paper explains a study on FMS using Petri net reduction. A PN underlies event structures with casuality and compatibility relations. Partial order methods and reduction methods reduce the complexity of constructing the reachability graph. The determination of PN system through reduction methods in recent years focused by many researchers. The significance of reduction methods are highlighted to execute the faster analysis of a system. Instead of coverability trees and the graphical representation the incidence matrix of the PNs are used for the reduction methods. Reduction methods are used to simplify large scale PNs into “equivalent” smaller nets. Boundedness, liveness, simplification of implicit places, shared resources and elimination of self-loops are checked though equivalent smaller nets. The structure of FMS is preserved.

A Petri net with controller is used to model discrete events in flexible job shop scheduling, the objective of scheduling problems is to minimize make-span, the scheduling results is obtained based on genetic and Tabu Search (TS) algorithm. It is proved capable of providing optimized schedule to the job-shop where the machine tool and manpower resources are both constrained. After crossover and mutation operations, an optimal or suboptimal scheduling plan can be found. The result of the test shows that this method is feasible and efficient. Job shop scheduling is the primary content and critical technology of the production management of CIMS, in the past during 30 years, a lot of researchers and results focus on it, but most of them deal with single objective and resource scheduling problems which are fixed processing route and constrained by machine, and production period is its optimal objective. Nevertheless, the production styles are variable and processing route is determined under the special condition. Moreover, job shop scheduling problem is the most difficult combined constraints optimal problem and typical NP hard problem which can't be solved in polynomial time by an effective algorithm. Up to date, there are some traditional algorithms to solve JSP problem (1-2). About paper (3), Petri net is used to construct JSP model and L1 which combines branch and bound algorithm with dynamic program is used to search its optimal solution. And paper (4), the job sequence is assigned by genetic code firstly, and then filtered beam search which based on breadth-first algorithm is adopted to search. In recent years, the Petri net as a discrete event dynamic system modeling and analysis tool(5), has been successfully applied to the flexible manufacturing system modeling, analysis and control. Some researchers put forward to be based on Petri network scheduling method, but only on the production line itself can not reflect the modeling, as in the production line of external control scheduling strategy influence. A hybrid algorithm is proposed to solve dual-resource scheduling problem in flexible production environment, and Petri net model with a controller, which can effectively model control. It combines the advantage of global search ability of GA with the self-adaptive merit of Tabu Search (TS) and improves its convergence. It is proved capable of global and part searching ability and efficient.

A GSPN-Based automatic analysis tool for discrete event systems

The process knowledge can be extracted based on the process mining technology from event logs, which can be generated from information systems. The event logs can be mined to construct a process model. The business process recognized by information systems can be described accurately by repairing the models. Some model-consistent metrics cannot be enhanced by the existing model repair approaches efficiently, such as generalization, precision, simplicity, and fitness. Thus, in this paper, we propose an approach for repairing the models via a logic Petri net (LPN). First, it builds process models by LPN. Next, for process models containing choice structures, the model repair approaches are proposed. Specifically, some relations between the transitions in the choice structure are studied in order to decide the positions where to repair the model. Finally, some examples of thoracic surgery processes in a hospital are given. Comparing with the state-of-the-art approaches in the literature, experimental results show that the fitness and precision of the models can be improved based on our proposed approach effectively.

This article is devoted to the modeling, performance evaluation and robust control of the railway transport network in Sahel Tunisia. The regular increase in the number of passengers makes the management of transportation systems more and more complex. Railway transport requires specific needs. Indeed, many decision and optimization problems occur from the planning phase to the implementation phase. Railway transport networks can be considered as discrete event systems with time constraints. The time factor is a critical parameter, since it includes schedules to be respected in order to avoid overlaps, delays and collisions between trains. The uncertainties affect the service and the availability of transportation resources and, consequently, the transport scheduling plan. Petri nets have been recognized as powerful modeling and analysis tools for discrete event systems with time constraints. Consequently, they are suitable for railway transport systems. In this article, stochastic P-time Petri nets are used for the railway transport networks in Sahel Tunisia. A global model is first detailed. Then, this model is used to analyze the network traffic and evaluate the performance of the system. Robustness again disturbances is introduced and a control strategy is developed to reduce the consequences of the disturbances in order to maintain the expected schedule.

Driven by fierce global competition, reducing costs while improving customer services by effective supply chain logistics management has become one main concern of most companies. This has created needs for modelling, performance analysis and optimisation tools that can help these companies to improve their logistics networks and operations. In this paper, the advantages of Petri nets as modelling and analysis tools for logistics systems are demonstrated, the recent developments of using Petri net based approaches for modelling, performance analysis, and optimisation of supply chains are reviewed, and future research directions for this important area are explored.

Modeling and Simulation of Flexible Manufacturing Systems Controlled by Petri Nets

1.1 Relationship between Petri net and linear logic Petri nets were first introduced by Petri in his seminal Ph.D. thesis, and both the theory and the applications of his model have flourished in concurrency theory (Reisig & Rozenberg, 1998a; Reisig & Rozenberg, 1998b). The relationships between Petri nets and linear logics have been studied by many researchers (Engberg & Winskel, 1997; Farwer, 1999; Hirai, 2000; Hirai 1999; Ishihara & Hiraish, 2001; Kamide, 2004, Kamide, 2006; Kanovich, 1995; Kanovich 1994; LarcheyWendling & Galmiche, 1998; Larchey-Wendling & Galmiche, 2000; Lilius, 1992; Mart -Oliet & Meseguer, 1991; Okada, 1998; Tanabe, 1997). A category theoretical investigation of such a relationship was given by Mart -Oliet and Meseguer (Mart -Oliet & Meseguer, 1991), purely syntactical approach using Horn linear logic was established by Kanovich (Kanovich, 1995; Kanovich 1994), a naive phase linear logic for a certain class of Petri nets was given by Okada (Okada, 1998), a linear logical view of object Petri nets were studied by Farwer (Farwer, 1999), and various Petri net interpretations of linear logic using quantale models were obtained by Ishihara and Hiraishi (Ishihara & Hiraish, 2001), Engberg and Winskel (Engberg & Winskel, 1997), Larchey-Wendling and Galmiche (Larchey-Wendling & Galmiche, 1998; Larchey-Wendling & Galmiche, 2000), and Lilius (Lilius, 1992). Petri net interpretations using Kripke semantics for various fragments and extensions of intuitionistic linear logic were studied by Kamide (Kamide, 2004; Kamide, 2006c). In (Kamide, 2004), Petri net interpretations of various fragments of a spatio-temporal soft linear logic were discussed. In (Kamide, 2006c), Petri nets with inhibitor arcs, which were first introduced by Kosaraju (Kosaraju, 1973) to show the limitation of the usual Petri nets, were described using Kripke semantics for intuitionistic linear logic with strong negation. The approarches using Kripke semantics can obtain a very simple correspondence between Petri net and linear logic.

The paper is a partial synthesis of the work that a team within the Faculty of Managerial and Technological Engineering has in the field of modeling and simulation of systems with Petri nets. The paper deals with three issues. The first part is Modeling and simulation of manufacturing systems with timed Petri nets. The first part presents the way in which the performances of some manufacturing systems are evaluated using timed Petri nets. The first example is a manufacturing system specific to the textile industry. The system has three production lines. In this case, the modeling with timed Petri nets allows the analysis of the operation of the flow lines and highlights the bottleneck. Another modeled manufacturing system is specific to a series production, more precisely it refers to the manufacture of gas cookers within a company from Oradea. The model with Petri nets also describes the supply sequences of the stocks of parts and subassemblies. The next modeled system is an automated manufacturing system for the packaging of detergents. The complexity of the Detergent Packing System and the high level of automation, require the use of efficient modeling and simulation methods to verify the validity of the solutions adopted. In this chapter is present the model of a robotic welding cell. The second part of the paper, the transition from timed Petri nets to hierarchical colored Petri nets, shows how Petri nets were developed for a robotic cell for metallographic analysis. The third part is dedicated to modeling with colored Petri nets timed with complex colors of the flexible manufacturing cell A007 within the Department of Industrial Engineering.

The paper considers the methods of modeling and control of discrete event robotic manufacturing systems using Petri nets and proposes a methodology of decomposition and coordination for hierarchical and distributed control. First, a task specification is defined as a Petri net model at the conceptual level, and then transformed to the detailed Petri net representation of the subtasks. Finally, the overall Petri net is decomposed and the constituent subnets are assigned to local Petri net based controllers. The coordinator is introduced to coordinate the distributed controllers so that the behavior of the distributed system is the same as that of the original Petri net. A coordination algorithm by two control levels is developed for defining robot and machine activation conditions. Based on the proposed method, a distributed control system has been implemented for a robotic manufacturing cell.

The specification and distributed control of discrete event robotic manufacturing systems using Petri nets are considered, and a methodology of decomposition and coordination is presented for hierarchical and distributed control. First, a task specification is defined as a Petri net model at the conceptual level, and then transformed to the detailed Petri net representation of the subtasks. Finally, the overall Petri net is decomposed and the constituent subnets are assigned to local Petri net based controllers. The controllers are coordinated by the coordinator so that the decomposed transitions fire at the same time. System coordination algorithm through communication between the coordinator and the controllers, is presented. By the proposed method, modeling, simulation and control of large and complex manufacturing systems can be performed consistently using Petri nets.

Nowadays, Petri net models have been used as a very promising modelling tool for systems and it presents randomness, concurrency, and synchronisation. Many researchers give attention to Petri nets because of its wide utilization. Therefore, reusability, sharing, and standardization are three functions that Petri nets must have. To actualized this concept, Semantic Web technologies can be implemented. One of the Semantic Web technologies is Ontology. In this paper, a formal approach for representing a business process in Petri nets into Ontologies is proposed. Firstly, a business process in Petri nets is presented. Then, formal definitions of Petri nets and OWL DL ontologies are introduced. Next step, converting a business process in Petri nets into OWL DL ontologies. Finally, using SPARQL Query in OWL DL ontologies to make sure that the relations of the business process in Petri nets are the same as the relations of the business process in OWL DL ontologies.

Petri net (PN), as a kind of powerful modeling tool for discrete-event dynamic systems, has widely applied in many domains. In this paper, two classes of high-level PN, controlled colored Petri net and controlled hybrid Petri net, are proposed and applied in the unit-commitment (UC) problem for a regional power grid with pumped storage stations. At the same time, the principle of large-scale system decomposition-coordination is applied to solve the problem of optimizing system operation. As a result, the UC problem is further simplified, as well as the algorithm efficiency improved. The proposed solution based on the high-level PN models, dynamic programming and decomposition-coordination theory, provides a new modeling methodology and could result in a superior dispatch plan for a regional power grid. (6 pages)

An appropriate cloud service process can be obtained by applying similarity computation between service request and the existing service processes in renting or recommending cloud service processes. To improve efficiency of the similarity computation, a similarity computing method based on Levenshtein distance and logic Petri net for renting cloud service processes was proposed in this paper. Cloud service processes were first modeled as service nets by logic Petri nets. A method to generate path strings for service nets was put forward by introducing the routing identifiers. Business flows of cloud service processes were then converted into path strings based on reduction and recursion. Similarly, service request was mapped as a request string by the path string generating method. Finally, similarity computation was performed based on Levenshtein distance between path strings and request string. The algorithm for similarity computation was also presented. A case study was finally presented to show the effectiveness of the proposed method.