Distributed program reliability based on minimum file spanning trees

The objective of this thesis was to develop a generalized modeling technique using Petri Nets based on Minimum File Sparming trees and to generate reliability measures for a distributed program in the given distributed computing environment. A global repair state was also incorporated into the final model to measure the availability of the program. (The idea proposed features the concept of using Minimum File Spanning trees as the major component in the Petri Net model rather than the individual components of the system, thereby achieving a reduction in the state space and improved efficiency in the generation of reliability results.