78   Journal of Engineering, Mechanics and Architecture                      www. grnjournal.us  

 
 

AMERICAN Journal of Engineering,  
Mechanics and Architecture 

Volume 2, Issue 5, 2024 ISSN (E): 2993-2637 

 
  

Simulation of Container Data Processing Using Petri Nets 
 

Kamaletdinov Shohrukh Shukhratovich 

Tashkent State Transport University, Doctoral student ( DSc ) 

 

Abstract: This article presents a process model for processing container data using Petri nets 

obtained from an automatic monitoring system for rolling stock and containers. This model 

makes it possible to check the operation of parallel processes and evaluate the quality of work as 

a whole.  

Keywords: Petri nets, container, automatic system, modeling, Internet of things. 

 

 

The algorithm for processing data about containers has a unique character. The container can be 

located separately from the rolling stock, on a carriage or as part of a specific train. But the most 

important information is the location, namely the territorial object in which the container is 

located. 

The geolocation sensor is attached to the container from the outside. One individual sensor for 

one locomotive. The sensor periodically sends a signal about the location of this container, that 

is, the longitude and latitude coordinates.  From the ASMPS database, the container number is 

searched by the sensor number. Since the numbers of sensors and containers are interrelated. If 

the number is not found when searching for a container from the database, the sensor 

information will not be saved in the database. The system console will indicate that the container 

was not found in the database. This can mainly happen when the sensor has not been registered 

in the system. 

The sensor will transmit a data set that includes information about the geolocation of the 

container. The system will process longitude and latitude data to determine the corresponding 

territorial feature. The parameters of the size and characteristics of the territorial object are pre-

entered into the database. Through the Automated Transportation Data Processing System 

(ATDPS), the availability of a container on the wagon will be checked. This information is 

checked using the sending model of the automated control system. 

If the container is not detected on the car, then parameters such as the car number and train index 

will remain empty. If the container is on a wagon, the system will determine the wagon number. 

Then, information about the destination station of the loaded car will be obtained from the 

ASOUP database. Using the car number, it will be possible to search for the location of the 

container on a specific train. The train search operation is carried out using automated control 

system. If a wagon is not detected on a train, information about the container is stored as being 

on a wagon that is not coupled. The index of the train on which the container is located is 

determined. A container history object is created, the parameters of which are filled in according 

to the received data and saved. 

The Petri net (PN) theory, first described in 1962 by the German mathematician Carl Petri, is 

now widely used in almost all branches of scientific research. SPs are a convenient mathematical 

apparatus for formalization, analysis and modeling of discrete event systems]. Due to the loosely 



 

79   Journal of Engineering, Mechanics and Architecture                      www. grnjournal.us  

 
 

coupled multi-level structure, SPs can be used to effectively simulate various technological 

processes. SP methodology is widely used for fault detection and diagnosis of discrete event 

systems . 

Definition. The Petri net C is a quadruple , 𝐶 = (𝑃, 𝑇, 𝐼, 𝑂). 

𝑃 = {𝑝1, 𝑝2, … , 𝑝𝑛} – a finite set of positions, 𝑛 ≥ 0. 𝑇 = {𝑡1, 𝑡2, … 𝑡𝑚}– a finite set of 

transitions, 𝑚 ≥ 0. The set of positions and the set of transitions do not intersect 𝑃⋂T = ∅. 

𝐼: 𝑇 → 𝑃∞ is an input function - a mapping from transitions to sets of positions.𝑂: 𝑇 → 𝑃∞ there 

is an output function - mapping from transitions to sets of positions. 

Definition. The Petri net graph 𝐺is a bipartite oriented multigraph, 𝐺 = (𝑉, 𝐴), where 𝑉 =
{𝑢1, 𝑢2, … , 𝑢𝑠}is the set of vertices, and𝐴 = {𝑎1, 𝑎2, … , 𝑎𝑇} – a set of directed arcs, 𝑎𝑖 = (𝑣𝑗 , 𝑣𝑘), 

where 𝑣𝑗 , 𝑣𝑘 ∈  𝑉. The set 𝑉can be divided into two disjoint subsets𝑃 and 𝑇such that𝑉 = 𝑃⋃𝑇, 

𝑃⋂𝑇 = ∅and for any directed arc 𝑎𝑖 ∈ 𝐴, if 𝑎𝑖 = (𝑣𝑗, 𝑣𝑘), then either 𝑣𝑗 ∈  𝑃 and 𝑣𝑘 ∈  𝑇, or 

𝑣𝑗 ∈  𝑇, a 𝑣𝑘 ∈  𝑃. 

Marking𝜇 Petri nets𝐶 = (𝑃, 𝑇, 𝐼, 𝑂) is a function that maps a set of positions 𝑃to a set of non-

negative integers N. 

𝜇: 𝑃 → 𝑁      ( 1 ) 

Marking 𝜇can also be defined as an n-vector 𝜇 = (𝜇1, 𝜇1, … , , 𝜇𝑛), where 𝑛 = |𝑃|and 𝜇𝑖 ∈
𝑁each𝑖 = 1, … , 𝑛. The vector 𝜇defines for each position𝜇𝑖 Petri net is the number of chips in this 

position. 

A marked Petri net 𝑀 = (𝐶, 𝜇)is a set of Petri net structures𝐶 = (𝑃, 𝑇, 𝐼, 𝑂) and markings 𝜇and 

can be written in the form 𝑀 = (𝑃, 𝑇, 𝐼, 𝑂, 𝜇). 

 

Figure 1. Data Processing Process Model 

All proposed extensions are aimed at creating the ability to check for zero in Petri nets. The 

simplest extension of Petri nets that can be checked for null are restraining arcs. Restraining arc 

from position p; into transition t, has a small circle rather than an arrow at the end of the arc 

attached to the transition. The triggering rule changes as follows: a transition is allowed when 

tokens are present in all of its (regular) inputs and absent in the restraining inputs. A transition is 

triggered by removing tokens from all of its (regular) inputs. 



 

80   Journal of Engineering, Mechanics and Architecture                      www. grnjournal.us  

 
 

Let's define an extended input and output function 

𝐼: 𝑇 → 𝑃∞ ,  𝑂: 𝑇 → 𝑃∞      [2] 

so that 

# (𝑡𝑗 , 𝐼(𝑝𝑖)) = # (𝑝𝑖 , 𝑂(𝑡𝑗)) , # (𝑡𝑗 , 𝑂(𝑝𝑖)) = # (𝑝𝑖, 𝐼(𝑡𝑗))  [3] 

For the Petri net in Fig. 1, the extended input and output functions are: 

𝑀 = (𝑃, 𝑇, 𝐼, 𝑂, 𝜇)     [4] 

𝑃 = (𝑝0, 𝑝1, 𝑝2, 𝑝3, 𝑝4, 𝑝5, 𝑝6, 𝑝7, 𝑝8, 𝑝9, 𝑝10, 𝑝11, 𝑝12, 𝑝13, 𝑝14, 𝑝15, 𝑝16, 𝑝17, 𝑝18, 𝑝19) [5] 

𝑇 = (𝑡0, 𝑡1, 𝑡2, 𝑡3, 𝑡4, 𝑡5, 𝑡6, 𝑡7, 𝑡8, 𝑡9, 𝑡10, 𝑡11, 𝑡12, 𝑡13, 𝑡14, 𝑡15, 𝑡16, 𝑡17, 𝑡18, 𝑡19)  [6]  

      

The created model using a Petri net provides a clear representation of the sequence of actions 

and logical connections between positions. The illustration presented as part of this work was 

developed using the HPSim program . The correct functioning of Petri nets was checked, and 

imitation of the movement of “chips” through the network allows us to identify vulnerabilities 

during modeling. Considering that the loading planning system is automated, the Petri net 

method is excellent for assessing the effectiveness of automated systems. 

Literature 

1. Арипов, Н. М., Камалетдинов, Ш. Ш.. Моделирование сменно-суточного 

планирования выгрузки и погрузки вагонов. Academic Research in Educational Sciences, 

3(9), 2022 – 34–43. 

2. Камалетдинов, Ш.Ш., Арипов, Н.М. (2022). Функциональное моделирование текущего 

планирования местной работы. Academic Research in Educational Sciences, 3(9), 2022 – 

119–124. 

3. Питерсон Дж. Теория сетей Петри и моделирование систем. Пер. с англ. – М.: Мир, 

1984. – 264с. 

4. Roy, Bernard. “Transitivité Et Connexité.” Comptes Rendus Del' Académie Des Sciences 

249 (1959): 216–218. 

5. Warshall, Stephen. “A Theorem on Boolean Matrices.” Journal of the ACM 9, no. 1 (January 

1, 1962): 11–12. doi:10.1145/321105.321107. 

6. Floyd, Robert W. “Algorithm 97: Shortest Path.” Communications of the ACM 5, no. 6 (June 

1, 1962): 345. doi:10.1145/367766.368168.