Intuitive Mapping of UML 2 Activity Diagrams into Fundamental Modeling Concept Petri Net Diagrams and Colored Petri Nets

Author(s):  
Tony Spiteri Staines
Author(s):  
Goharik Petrosyan ◽  
Armen Gaboutchian ◽  
Vladimir Knyaz

Petri nets are a mathematical apparatus for modelling dynamic discrete systems. Their feature is the ability to display parallelism, asynchrony and hierarchy. First was described by Karl Petri in 1962 [1,2,8]. The Petri net is a bipartite oriented graph consisting of two types of vertices - positions and transitions connected by arcs between each other; vertices of the same type cannot be directly connected. Positions can be placed by tags (markers) that can move around the network. [2] Petri Nets (PN) used for modelling real systems is sometimes referred to as Condition/Events nets. Places identify the conditions of the parts of the system (working, idling, queuing, and failing), and transitions describe the passage from one state to another (end of a task, failure, repair...). An event occurs (a transition fire) when all the conditions are satisfied (input places are marked) and give concession to the event. The occurrence of the event entirely or partially modifies the status of the conditions (marking). The number of tokens in a place can be used to identify the number of resources lying in the condition denoted by that place [1,2,8]. Coloured Petri nets (CPN) is a graphical oriented language for design, specification, simulation and verification of systems [3-6,9,15]. It is in particular well-suited for systems that consist of several processes which communicate and synchronize. Typical examples of application areas are communication protocols, distributed systems, automated production systems, workflow analysis and VLSI chips. In the Classical Petri Net, tokens do not differ; we can say that they are colourless. Unlike standard Petri nets in Colored Petri Net of a position can contain tokens of arbitrary complexity, such as lists, etc., that enables modelling to be more reliable. The article is devoted to the study of the possibilities of modelling Colored Petri nets. The article discusses the interrelation of languages of the Colored Petri nets and traditional formal languages. The Venn diagram, which the author has modified, shows the relationship between the languages of the Colored Petri nets and some traditional languages. The language class of the Colored Petri nets includes a whole class of Context-free languages and some other classes. The paper shows modelling the task synchronization Patil using Colored Petri net, which can't be modeled using well- known operations P and V or by classical Petri network, since the operations P and V and classical Petri networks have limited mathematical properties which do not allow to model the mechanisms in which the process should be synchronized with the optimal allocation of resources.


2020 ◽  
Vol 10 (16) ◽  
pp. 5644 ◽  
Author(s):  
Stavros Souravlas ◽  
Stefanos Katsavounis ◽  
Sofia Anastasiadou

The Petri net (PN) formalism is a suitable tool for modeling parallel systems due to its basic characteristics, such as synchronization. The extension of PN, the Colored Petri Nets (CPN) allows the incorporation of more details of the real system into the model (for example, contention for shared resources). The CPNs have been widely used in a variety of fields to produce suitable models. One of their biggest strengths is that their overall philosophy is quite similar to the philosophy of the object-oriented paradigm. In this regard, the CPN models can be used to implement simulators in a rather straightforward way. In this paper, the CPN framework is employed to implement a new resource allocation simulator, which is used to verify the performance of our previous work, where we proposed a fair resource allocation scheme with flow control and maximum utilization of the system’s resources.


Author(s):  
Fei Liu ◽  
Ming Yang

Colored Petri nets have been demonstrated as a powerful tool for modeling multiscale systems biology. However, the construction of colored Petri nets for biological systems requires prior knowledge about colored Petri nets and is often error-prone and cumbersome for biologists, especially when the communication between components and hierarchical organization of components in a multiscale model are an issue. To address this problem, an established way is to develop small components and then compose them into bigger models. In this paper, we present a compositional colored Petri net approach to aid automatic modeling of systems biology, and demonstrate it with two case studies. We focus on the modeling of communication between components and hierarchical organization of components as they are key to build multiscale models.


Author(s):  
Dmitry A. Zaitsev ◽  
Tatiana R. Shmeleva

Aviation and aerospace systems are complex and concurrent and require special tools for their specification, verification, and performance evaluation. The tool in demand should be easily integrated into the standard loop of model-driven development. Colored Petri nets represent a combination of a Petri net graph and a functional programming language ML that makes it powerful and convenient tool for specification of real-life system and solving both tasks: correctness proof i.e. verification and performance evaluation. This chapter studies basic and advanced features of CPN Tools – a powerful modeling system which uses graphical language of colored Petri nets. Starting with a concept of colored hierarhical timed Petri net, it goes through declaration of color sets and functions to peculiarities of hierarchical design of complex models and specification of timed characteristics. The authors accomplish the chapter with a real-life case study of performance evaluation for switched Ethernet network.


2006 ◽  
Vol 25 ◽  
pp. 349-387 ◽  
Author(s):  
G. Gutnik ◽  
G. A. Kaminka

Open distributed multi-agent systems are gaining interest in the academic community and in industry. In such open settings, agents are often coordinated using standardized agent conversation protocols. The representation of such protocols (for analysis, validation, monitoring, etc) is an important aspect of multi-agent applications. Recently, Petri nets have been shown to be an interesting approach to such representation, and radically different approaches using Petri nets have been proposed. However, their relative strengths and weaknesses have not been examined. Moreover, their scalability and suitability for different tasks have not been addressed. This paper addresses both these challenges. First, we analyze existing Petri net representations in terms of their scalability and appropriateness for overhearing, an important task in monitoring open multi-agent systems. Then, building on the insights gained, we introduce a novel representation using Colored Petri nets that explicitly represent legal joint conversation states and messages. This representation approach offers significant improvements in scalability and is particularly suitable for overhearing. Furthermore, we show that this new representation offers a comprehensive coverage of all conversation features of FIPA conversation standards. We also present a procedure for transforming AUML conversation protocol diagrams (a standard human-readable representation), to our Colored Petri net representation.


Author(s):  
Dmitry A. Zaitsev ◽  
Tatiana R. Shmeleva

Aviation and aerospace systems are complex and concurrent and require special tools for their specification, verification, and performance evaluation. The tool in demand should be easily integrated into the standard loop of model-driven development. Colored Petri nets represent a combination of a Petri net graph and a functional programming language ML that makes it powerful and convenient tool for specification of real-life system and solving both tasks: correctness proof i.e. verification and performance evaluation. This chapter studies basic and advanced features of CPN Tools – a powerful modeling system which uses graphical language of colored Petri nets. Starting with a concept of colored hierarhical timed Petri net, it goes through declaration of color sets and functions to peculiarities of hierarchical design of complex models and specification of timed characteristics. The authors accomplish the chapter with a real-life case study of performance evaluation for switched Ethernet network.


Processes ◽  
2019 ◽  
Vol 8 (1) ◽  
pp. 21 ◽  
Author(s):  
Husam Kaid ◽  
Abdulrahman Al-Ahmari ◽  
Zhiwu Li ◽  
Reggie Davidrajuh

Deadlock control approaches based on Petri nets are usually implemented by adding control places and related arcs to the Petri net model of a system. The main disadvantage of the existing policies is that many control places and associated arcs are added to the initially constructed Petri net model, which significantly increases the complexity of the supervisor of the Petri net model. The objective of this study is to develop a two-step robust deadlock control approach. In the first step, we use a method of deadlock prevention based on strict minimal siphons (SMSs) to create a controlled Petri net model. In the second step, all control places obtained in the first step are merged into a single control place based on the colored Petri net to mark all SMSs. Finally, we compare the proposed method with the existing methods from the literature.


2014 ◽  
Vol 22 (03) ◽  
pp. 463-493 ◽  
Author(s):  
FEI LIU ◽  
MONIKA HEINER ◽  
MING YANG

Colored Petri nets allow compact, parameterizable and scalable representations of large-scale biological models by encoding, e.g., species as colored tokens, and offer a variety of analysis techniques, e.g., structural analysis, simulation and model checking to analyze biological models. However, so far colored Petri nets have not been widely used and well explored in systems biology. In this paper, we aim to present a systematic approach to modeling and analyzing complex biological systems using colored Petri nets in order to help biologists to easily use them. We first describe a framework comprising a family of related colored Petri nets: colored qualitative Petri net (𝒬𝒫𝒩𝒞), colored stochastic Petri net (𝒮𝒫𝒩𝒞) and colored continuous Petri net (𝒞𝒫𝒩𝒞). They share structure, but are specialized by their kinetic information. Based on this framework, we present our colored Petri net approach to modeling and analyzing complex biological systems. First a biological system is modeled as a hierarchical 𝒬𝒫𝒩𝒞model, animated and analyzed by structural analysis; then it is converted into a 𝒮𝒫𝒩𝒞or 𝒞𝒫𝒩𝒞model, to be further analyzed using stochastic or continuous simulation, and simulative or numerical model checking. We demonstrate this approach using a nontrivial example, Caenorhabditis elegans vulval development.


2013 ◽  
Vol 21 (4) ◽  
pp. 241-247
Author(s):  
Mitsuru Jitsukawa ◽  
Pauline N. Kawamoto ◽  
Yasunari Shidama

Abstract Based on the Petri net definitions and theorems already formalized in the Mizar article [13], in this article we were able to formalize the definition of cell Petri nets. It is based on [12]. Colored Petri net has already been defined in [11]. In addition, the conditions of the firing rule and the colored set to this definition, that defines the cell Petri nets are further extended to CPNT.i further. The synthesis of two Petri nets was introduced in [11] and in this work the definition is extended to produce the synthesis of a family of colored Petri nets. Specifically, the extension to a CPNT family is performed by specifying how to link the outbound transitions of each colored Petri net to the place elements of other nets to form a neighborhood relationship. Finally, the activation of colored Petri nets was formalized.


Sign in / Sign up

Export Citation Format

Share Document