z-logo
open-access-imgOpen Access
Petri transport networks
Author(s) -
Irina Sedykh,
D. Demakhin
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1553/1/012025
Subject(s) - petri net , computer science , process architecture , class (philosophy) , distributed computing , probabilistic logic , petri dish , complex system , synchronization (alternating current) , relevance (law) , theoretical computer science , artificial intelligence , computer network , channel (broadcasting) , biology , political science , law , genetics
This paper presents a new class of Petri nets - Petri transport networks, used to simulate the transport’s systems. This class can be attributed to hierarchical temporal colored probabilistic Petri nets. The paper gives a definition, basic concepts, structure and functioning rules of Petri transport networks. The relevance of the topic raised in the article is due to increasing attention to the development of transport systems, their evolution and modernization. Modern management methods, various mechanisms for regulating traffic flows, infrastructural extensions, all this does not meet the challenges posed by modern transport infrastructure. Moreover, the problem is increasing every year. Petri transport networks introduced in the work, are a convenient tool ohms to simulate the transport’s systems of any complexity and scale. A new class of Petri transport networks is characterized by a hierarchical structure, in which the first level displays the entire system as a whole, the second - the internal structure of each object. Distinctive features are also the adjustment of the activation of traffic flows by means of a control marker, inter-level synchronization, separation of positions and transitions to types having different functions.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here