This thesis research is an implementation of a closed-form analytical technique for study, evaluation and analysis of Stochastic Petri Nets (SPN). The technique is based on a theorem that an isomorphism exists between an SPN and a Markov Chain. The procedure comprises five main steps: reachability graph generation of the underlying Petri net, transformation of the reachability graph to a state machine Petri net, calculation of transfer functions, computation of equivalent transfer functions via Mason's rule, and computation of performance parameters of the SPN model from the equivalent transfer functions and their derivatives. The software is developed in UNIX using C and applied to various SPN models. Future research includes implementation of Mason's rule for complex cases and symbolic derivation of equivalent transfer functions.