DocumentCode
358569
Title
Stochastic automata networks for dependability modelling
Author
Stewart, William J. ; Plateau, Brigitte
Author_Institution
Dept. of Comput. Sci., North Carolina State Univ., Raleigh, NC, USA
Volume
4
fYear
2000
fDate
2000
Firstpage
435
Abstract
Stochastic automata networks have been used in the past with success to model parallel and distributed systems. It is our contention that they can also be used effectively to solve dependability models. These models possess characteristics that the SAN approach can exploit. In particular, the SAN approach completely eliminates the problem most often associated with this type of modelling, namely, the need for large amounts of computer memory. The only remaining difficulty is to show that the computation time is not excessive and this we attempt to do by providing a number of modelling strategems and numerical techniques designed to ensure that the time needed to compute solutions remains modest
Keywords
computational complexity; modelling; process algebra; reliability theory; stochastic automata; tensors; Markov chain; computation time; dependability modelling; descriptor; functional transitions; generalized tensor algebra; modelling strategems; state space reduction; stochastic automata networks; Automata; Computer science; Numerical models; Sparse matrices; Stochastic processes; Stochastic systems; Storage area networks; System performance; Technology management; Tensile stress;
fLanguage
English
Publisher
ieee
Conference_Titel
Aerospace Conference Proceedings, 2000 IEEE
Conference_Location
Big Sky, MT
ISSN
1095-323X
Print_ISBN
0-7803-5846-5
Type
conf
DOI
10.1109/AERO.2000.878455
Filename
878455
Link To Document