Discrete Approach to Simulating Synchronized Relay Races
E. V. Larkina, *, A. N. Privalovb, **, and A. V. Bogomolova, ***
aTula State University, Tula, 300012 Russia
bTolstoy Tula State Pedagogical University, Tula, 300041 Russia
Correspondence to: *e-mail: elarkin@mail.ru
Correspondence to: **e-mail: privalov.61@mail.ru
Correspondence to: ***e-mail: a.v.bogomolov@gmail.com
Received 15 November, 2019
Abstract—A discrete model of a system is constructed consisting of competing teams covering a distance divided into stages such that a stage is considered complete if all team members overcome it, and within each team competition for passing the stages is organized. The model of internal competition in a team is based on the concept of the Petri–Markov net used to discretely describe the synchronization effect: the primary model is transformed into a K-parallel discrete semi-Markov process, which describes relay-type competition between individual teams in which there is no synchronization. The formation of an optimal team activity schedule is based on the concept of distributed penalties.
Keywords: discrete distribution, semi-Markov process, Petri–Markov nets, synchronization, relay race, distributed penalty
DOI: 10.3103/S0005105520010082