Thesis (Ph.D.). Storrs, CT (US): Univ. of Connecticut., 1988.
Abstract: Many computer systems are best modeled as sets of independent communicating sequential processes. This thesis presents analytic methods for predicting the performance of these types of systems. The method uses an adaptation of CSP language. A Petri net is constructed from the CSP specification. By doing reachability analysis, a probabilistic grammar is derived that describes the possible sequences of messages. Several unique aspects of this approach are described, including transformation and simplification techniques that help avoid the state explosion problem.
Keywords: performance estimation; distributed computer system; CSP; reachability; probabilistic grammar; state explosion avoidance.