Issue No. 10 - October (1991 vol. 17)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.99196
<p>A methodology for modeling a system composed of parallel activities with synchronization points is proposed. Specifically, an approach based on a modular state-transition representation of a parallel system called the stochastic automata network (SAN) is developed. The state-space explosion is handled by a decomposition technique. The dynamic behavior of the algorithm is analyzed under Markovian assumptions. The transition matrix of the chain is automatically derived using tensor algebra operators, under a format which involves a very limited storage cost.</p>
parallel activities; synchronization points; modular state-transition representation; parallel system; stochastic automata network; SAN; state-space explosion; decomposition technique; Markovian assumptions; transition matrix; tensor algebra operators; storage cost; parallel algorithms; parallel architectures; performance evaluation; stochastic automata
K. Atif and B. Plateau, "Stochastic Automata Network of Modeling Parallel Systems," in IEEE Transactions on Software Engineering, vol. 17, no. , pp. 1093-1108, 1991.