The Community for Technology Leaders
Green Image
Issue No. 02 - March/April (2009 vol. 35)
ISSN: 0098-5589
pp: 178-194
Laura Carnevali , Università di Firenze, Firenze
Leonardo Grassi , Università di Firenze, Firenze
Enrico Vicario , Università di Firenze, Firenze
Quantitative evaluation of models with generally-distributed transitions requires analysis of non-Markovian processes that may be not isomorphic to their underlying untimed models and may include any number of concurrent non-exponential timers. The analysis of stochastic Time Petri Nets copes with the problem by covering the state space with stochastic-classes, which extend Difference Bounds Matrices (DBM) with a state probability density function. We show that the state-density function accepts a continuous piecewise representation over a partition in DBM-shaped sub-domains. We then develop a closed-form symbolic calculus of state-density functions assuming that model transitions have expolynomial distributions. The calculus shows that within each sub-domain the state-density function is a multivariate expolynomial function and makes explicit how this form evolves through subsequent transitions. This enables an efficient implementation of the analysis process and provides the formal basis that supports introduction of an approximate analysis based on Bernstein Polynomials. The approximation attacks practical and theoretical limits in the applicability of stochastic state-classes, and devises a new approach to the analysis of non Markovian models, relying on approximations in the state space rather than in the structure of the model.
Software Engineering, Tools, Validation, Software and System Safety, Software/Program Verification, Formal methods, Reliability, Automata, Parallelism and concurrency, Approximation, Markov processes, Renewal theory, Stochastic processes

L. Grassi, E. Vicario and L. Carnevali, "State-Density Functions over DBM Domains in the Analysis of Non-Markovian Models," in IEEE Transactions on Software Engineering, vol. 35, no. , pp. 178-194, 2008.
96 ms
(Ver 3.3 (11022016))