tion-aggregation, Reliability analysis

Special math needed for explanations: Language of graph modeling, probability Special math needed to use results: Language of graph modeling, prob-ability Results useful to: Reliability analysts and theoreticians Summary & Conclusions-We use dataflow graphs to represent the computational structure, analogous to Petri nets and Turing machines, and have developed a method for analyzing the reliability of computer systems modeled as dataflow graphs. Because of the hierarchical nature of dataflow graphs, systems can be analyzed at several levels of abstrac-tion. Reliabilities of subgraphs can be calculated using either traditional techniques or dataflow approach presented here (recursively). The reliabilities of subgraphs can then be combined leading to decomposition-aggregation approach. The time needed for an actor to complete its operation is not in-cluded in our analysis of dataflow graphs. Incorporation of the time ele-ment compounds the problem and we have not studied it yet. 1