Stochastic automata network of modeling parallel systems
- 1 January 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 17 (10) , 1093-1108
- https://doi.org/10.1109/32.99196
Abstract
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.Keywords
This publication has 8 references indexed in Scilit:
- A methodology for solving markov models of parallel systemsJournal of Parallel and Distributed Computing, 1991
- GSPN models of Markovian multiserver multiqueue systemsPerformance Evaluation, 1990
- A fast mutual exclusion algorithmACM Transactions on Computer Systems, 1987
- Performance analysis of multiprocessor cache consistency protocols using generalized timed Petri netsPublished by Association for Computing Machinery (ACM) ,1986
- On the stochastic structure of parallelism and synchronization models for distributed algorithmsPublished by Association for Computing Machinery (ACM) ,1985
- A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systemsACM Transactions on Computer Systems, 1984
- Performance Analysis Using Stochastic Petri NetsIEEE Transactions on Computers, 1982
- Kronecker products and shuffle algebraIEEE Transactions on Computers, 1981