Open AccessModeling of complex structured processes using discrete iterative networks and petri nets
Author(s) -
Andrey Mastislavovich Korneev,
Tamara Lavrukhina,
Tatyana Smetannikova,
Yu Glazkova
Publication year - 2021
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/2131/3/032004
Subject(s) - petri net , computer science , stochastic petri net , hierarchy , probabilistic logic , block (permutation group theory) , theoretical computer science , finite state machine , set (abstract data type) , iterative and incremental development , process architecture , algorithm , mathematical optimization , distributed computing , artificial intelligence , mathematics , programming language , geometry , software engineering , economics , market economy
The paper considers the use of discrete iterative networks and Petri nets in the modeling of complex structured processes. In general, the production process is represented as a composition of machines. Probabilistic finite machine are modeled to select optimal solutions from a certain set of alternative solutions. Alphabets of finite and probabilistic machines are formed on the basis of discrete optimization methods when modeling multi-stage productions. The processing mode adaptation block is used to change the alphabets when the production conditions are changed. Using the alphabet generation block allows you to choose the optimal value of the alphabets of the random variables under study. During modeling complex systems and developing algorithms for managing them, the presence of ambiguous functional relationships between factors and quality indicators is taken into account. Methods of modeling complex spatially distributed objects based on a hierarchy of machines belonging to a predetermined finite number of machine types using iterative networks and Petri nets are described.