Analysis and evaluation of non-Markovian Stochastic Petri Nets

In order to extend their applicability to more complex situations, in this paper we present a new approach for the analysis of non-Markovian Stochastic Petri Net (NMSPN) models, which is based on a discrete time approximation of the stochastic behavior of the marking process. The proposed approach, which resulted in a new modeling tool for the analysis of NMSPNs called WebSPN, allows to analyze a wider class of PN models with prd, prs and pri concurrently enabled generally distributed transitions. This implies the possibility of dealing with very complex systems with arbitrarily distributed events with very complex interrelations among each other. The adopted technique is described, an application example is solved and the results are carefully analyzed in order to demonstrate the validity of the proposed approach.