Coding Mobile Synchronizing Petri Nets into Rewriting Logic

On the Expressiveness of Mobile Synchronizing Petri Nets

With the aim of solving the problems of the Petri nets to the place/transition nets automatic conversion and realization of Petri nets parallel control and running, the algorithm is proposed to transform Color Petri net systems transform into P/T nets. The algebraic model of colored Petri nets and P/T nets, and its intrinsic mechanism is analyzed, the process and theory verification of the colored Petri nets into P/T nets are given. The colored Petri nets into P/T network algorithm is proposed, through the network model of formal, colored Petri nets correlation matrix pretreatment. Experimental results show that it is an effective method to solve Color Petri Net systems transform into P/T nets, lay the foundation for various senior Petri nets system transformation into P/T nets and achieve the parallelism and simulation of running.

The context of our work is the complex systems simulation. Complex systems modelling and simulation require to take into account the interactions between the different components. For instance, an airport ground traffic simulation requires to model the planes with the pilots, the control tower, the

The travelling salesman problem, which can be solved with various methods, is a traditional and typical problem in artificial intelligence (AI). As an evolution of Petri nets, colored Petri nets (CPN) can be dedicated to modeling and analysis of different systems as a new attempt. The paper shows the brief description of the given problem and CPN, we detail the implementation of the CPN model of the problem and analyze the simulation result. This CPN example shows the potentiality of CPN application in AI.

Petri Nets provide a graphical notation for modeling systems and performing analysis. Colored Petri Nets (CPNs) combine the strengths of ordinary Petri Nets with a high level programming language, making them more suitable for modeling large systems. A CPN model is an executable representation of a system that can be analyzed through simulation. CPN models are built using CPN Tools, a graphical software tool and interface used to create, edit, simulate, and analyze models. This tutorial is meant to introduce the reader to the vocabulary and constructs of CPNs and illustrate the use of CPN Tools in creating and simulating models by means of a familiar, simple example. In particular, we show how to create a CPN model of the call center example presented by White and Ingalls in their tutorial Introduction to Simulation.

In this work, the analysis of behavioural and structural features of automated systems has been investigated by using coloured Petri Nets (CPNs). CPN is one of the best modelling methods of the automated system. Many features of Petri Nets can be searched by reachability tree and invariants. They also show the features of CPN. Reachability tree shows the markings which can be reached by the net. With P invariants we can determine the correctness of the net. In this work, an algorithm to calculate reachability tree of automated systems is developed. P invariants of CPN is analysed and Martinez-Silva algorithm is applied to CPNs. Time performances of these methods are also determined.

Petri net (PN) is a classical tool for modeling, simulation, and analysis. With the emergence of distributed manufacturing system (DMS), PN has been evolved into different forms such as colored PN (CPN) and timed PN (TPN). To fulfill the practical requirements, CPN has been extended to a larger and more complex model. Meanwhile, DMS becomes an important issue for industry, and how to model a complex manufacturing network for better throughput needs further investigation. A simple single type of PN only cannot fulfill all contemporary requirements at the same time. This paper proposes a new concept for a new PN-hierarchical timed CPN (HTCPN), which can be a powerful tool for modeling, simulation, and analysis for current large complex distributed manufacturing system. This paper presents a general structure of DMS and uses HTCPN to model the manufacturing system as discrete event with dynamic behavior. The proposed approach shows superiority on modeling large complex manufacturing system as it represents the material flow and transitions clearly and provides overview and detailed description for DMS.

In this paper, we propose the new method for the parallel system design based on expanded the logical coloured Petri net (LCPN). An LCPN is an extended Petri net that solves the problem of system description in previously proposed place/transition nets and coloured Petri nets. This extension of Petri nets is suitable for designing complex control systems and for discussing methods of evaluating such systems realistically. In order to study the behaviour of the server system modelled with this net we simulated a Java program. This program confirmed that this extended Petri net is an effective tool for modelling the parallel system.

Analysis of controlled technological systems using high level petri nets

Specification and properties of a cache coherence protocol model.- GAMERU: A language for the analysis and design of human communication pragmatics within organizational systems.- Recent results on the complexity of problems related to Petri nets.- Algebraic structure of flows of a regular coloured net.- On equivalent execution semantics of concurrent systems.- Mathematical methods for calculating invariants in Petri nets.- On Petri nets with deterministic and exponentially distributed firing times.- An accurate performance model of CSMA/CD bus LAN.- Petri net models for the ?-calculus.- Fair processes.- Operational Petri net semantics for CCSP.- Infinitary languages of Petri nets and logical sentences.- A strong part of concurrency.- Concurrency and continuity.- Parallel systems specifications with coloured Petri nets and algebraic specifications.- Bibliography of Petri nets.

The wireless mesh network (WMN) is an emerging and cost-effective alternative paradigm for the next generation wireless networks in many diverse applications. In the performance evaluation of routing protocol for the WMN, it is essential that it should be evaluated under realistic conditions. The usefulness of specific mobility protocol can be determined by selection of mobility model. This paper introduces a coloured Petri nets (CP-nets) based formal model for implementation, simulation, and analysis of most widely used random waypoint (RWP) mobility model for WMNs. The formal semantics of hierarchical timed CP-nets allow us to investigate the terminating behavior of the transitions using state space analysis techniques. The proposed implementation improves the RWP mobility model by removing the “border effect” and resolves the “speed decay” problem.

Modelling passenger flows within a transport interchange is a compromise between computational speed and accuracy, especially if the model is to be embedded within an optimization procedure for managing the effects of disrupted traffic. Petri nets offer the possibility of the standardized representation of a concurrent dynamic system. Such a representation consists of a network formed by places that are linked together by arcs and transitions, and tokens that move around in this network. Using coloured Petri nets (CPNs) allows information to be associated with each token, such as the number of passengers represented by the token, the destinations of subgroups of those passengers and data related to measures such as accumulated passenger transit times. Practicalities such as the variation of walking speeds between passengers and the restricted capacity of features of the interchange infrastructure, such as escalators, can also be incorporated. Furthermore, the model is capable of being extended to represent the transport services themselves, at least within a reasonable area outside the interchange.

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.

Usually, the maximally permissive control of Petri nets with an OR-logic constraint is difficult to implement. In this paper, OR-logic is easily enforced using a colored Petri net. A colored Petri net place, named colored monitor place, is designed to monitor the states of constraints. A so-called guard function of colored Petri nets that maps certain transitions into a Boolean expression is suitably defined on the colored sets. The maximally permissive control is then obtained via the guard function. In addition, a constraint transformation method for marked graphs with uncontrollable transitions is proposed.

Coloured Petri Nets (CPNs) is a language for the modelling and validation of systems in which concurrency, communication, and synchronisation play a major role. Coloured Petri Nets is a discrete-ev...