Discrete Synchronized Relay Races

Abstract

One kind of relay races, in which all teams run distance stage-by-stage, and every stage is considered as completed when whole team overcome it, is considered. Such approach may conceptually describe enterprise operation, in which assembles, units etc. are made by shops and are installed into production one-by one, or it may be description of supercomputer operation. Teams compete between them, and competition in real physical time unfolds not only for victory on the whole distance, but for winning the stages. For simulation of passing stages by teams Petri-Markov nets are used. For simulation of the competition on the distance apparatus of parallel semi-Markov process is used. To do analysis suitable for cybernation discrete distributions of time intervals of passing stages are considered. Also distributed forfeits are considered as discrete ones. Formulae for calculation of forfeit, which one team receives from other teams, participated in relay race, are obtained