ALGORITHMS FOR ANALYZING NETWORK MODELS WITH STOCHASTIC STRUCTURE
Barishpolets Vitaly A.
Dorodnicyn Computing Centre, Russian Academy of Sciences, http://www.ccas.ru
40, Vavilova str., 119333 Moscow, Russian Federation
In this article we consider algorithms for the analysis of the network model with stochastic structure, rules of construction which the theoretical basis of the analysis set forth in . The first algorithm is presented for obtaining estimates of probability characteristics of the network model with stochastic structure and random duration of work using statistical modeling. This algorithm is appropriate when the construction of a network model with stochastic structure of the event are used with wide logical possibilities for the input and output. The second is an algorithm for determining estimates of probability characteristics of the network model with stochastic structure and random duration of works by a numerical method that can be used when the construction of the network model uses no more than four kinds of events . The basis of this algorithm is based on replacing the density distribution of the duration of each operation by the histogram.
: network model, algorithm, block diagram, algorithmic module, characteristics of the network model, approximating probability distribution, histogram, statistical series.
Bibliographies – 2 references
Full-text electronic version of this article - web site http://elibrary.ru
- Barishpolets VA. Setevoe modelirovanie stokhasticheskikh protsessov vypolneniya kompleksa vzaimosvyazannykh operatsiy [Network modeling of stochastic processes implementation of the complex of interrelated operations]. RENSIT, 2011, 3(2):49-73.
- Pospelov GS, Barishpolets VA, Novikov LS. Programmno-tselevoe planirovanie i upravlenie sozdaniem kompleksov voennoy tekhniki [Program-target planning and management of the creation of complexes of military equipment]. Moscow, Informtekhnika Publ., 1990, 408 p.