Specification, design, and implementation of logic controllers based on colored Petri net models and the standard IEC 1131. I. Specification and design

1999 ◽  
Vol 7 (6) ◽  
pp. 657-665 ◽  
Author(s):  
K. Feldmann ◽  
A.W. Colombo ◽  
C. Schnur ◽  
T. Stockel
Keyword(s):  
Petri Net ◽  
Colored Petri Net ◽  
Design And Implementation ◽  
Iec 1131 ◽  
Logic Controllers

Some Possibilities of Modeling Colored Petri Nets

2021 ◽  
pp. 77-91
Author(s):  
Goharik Petrosyan ◽  
Armen Gaboutchian ◽  
Vladimir Knyaz
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Optimal Allocation ◽  
Production Systems ◽  
Oriented Graph ◽  
Discrete Systems ◽  
Colored Petri Nets ◽  
Venn Diagram ◽  
Colored Petri Net ◽  
Language Class

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.

Sign in / Sign up

Export Citation Format

Share Document