The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - October (1991 vol.17)
pp: 1093-1108
ABSTRACT
<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>
INDEX TERMS
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
CITATION
B. Plateau, K. Atif, "Stochastic Automata Network of Modeling Parallel Systems", IEEE Transactions on Software Engineering, vol.17, no. 10, pp. 1093-1108, October 1991, doi:10.1109/32.99196
27 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool