Computing first passage time distributions in stochastic well-formed nets

The increasing demand for customer centric evaluation of systems, mostly related with the assessment of the quality of service that they can deliver, requires the development of techniques properly designed to model and to study the movement of specific entities generically referred to as "customers". Stochastic Well-Formed Net(SWN) are naturally suited for the representation of systems in which "customers" of different categories compete for the use of common resources. Color classes of SWN are easily associated with these different categories, leaving to the peculiar features of the formalism the possibility of exploiting all the symmetries existing into the representation for the efficient and effective computation of the measures of interest. Within this application context, the computation of first passage time distribution measures in Stochastic Well-Formed Net (SWN) is becoming of primary interest. Customers however are not primitive entities in the formalism and an approach similar to that previously developed for Generalized Stochastic Petri Nets (GSPN) is suggested to overcome this problem in which P-semiflows are used to identify the circulating "customers". In this paper we propose an original algorithm for computing some P-semiflows of colored PNs (in particular of SWNs) in parametric form by exploiting the peculiarities of the objective of this investigation, and extend the customer centric first passage time computation approach previously developed for GSPNs, to make it suitable for SWN models. Moreover, the paper proposes an enhancement of the SWN notation in order to provide a way to ease the modeler in the specification of customer scheduling policies that may affect the computation of first passage time distributions. This extension, inspired by Queueing Petri Nets, adds to SWN some "syntactic sugar" that allows to include in the model queueing places which are automatically replaced by appropriate submodels, before solving the model.

[1]  Souheib Baarir,et al.  Efficient lumpability check in partially symmetric systems , 2006, Third International Conference on the Quantitative Evaluation of Systems - (QEST'06).

[2]  Jean-François Pradat-Peyre,et al.  Generative Families of Positive Invariants in Coloured Nets Sub-Classes , 1991, Applications and Theory of Petri Nets.

[3]  Giovanni Chiola,et al.  Stochastic Well-Formed Colored Nets and Symmetric Modeling Applications , 1993, IEEE Trans. Computers.

[4]  Kurt Jensen Coloured Petri Nets , 1992, EATCS Monographs in Theoretical Computer Science.

[5]  Falko Bause,et al.  Stochastic Petri Nets: An Introduction to the Theory , 2012, PERV.

[6]  Nicholas J. Dingle,et al.  Automated Customer-Centric Performance Analysis of Generalised Stochastic Petri Nets Using Tagged Tokens , 2009, Electron. Notes Theor. Comput. Sci..

[7]  Stephen Gilmore,et al.  Derivation of passage-time densities in PEPA models using ipc: the imperial PEPA compiler , 2003, 11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003..

[8]  Samuel Kounev,et al.  Performance Modeling and Evaluation of Distributed Component-Based Systems Using Queueing Petri Nets , 2006, IEEE Transactions on Software Engineering.

[9]  Marco Beccuti,et al.  Stochastic Petri Nets Sensitivity to Token Scheduling Policies , 2010, OR.

[10]  S. Au-Yeung,et al.  Response times in healthcare systems , 2008 .

[11]  Peter G. Harrison,et al.  Uniformization and hypergraph partitioning for the distributed computation of response time densities in very large Markov models , 2004, J. Parallel Distributed Comput..

[12]  Allan Clark,et al.  State-Aware Performance Analysis with eXtended Stochastic Probes , 2008, EPEW.

[13]  Marco Ajmone Marsan,et al.  Modelling with Generalized Stochastic Petri Nets , 1995, PERV.

[14]  Marco Beccuti,et al.  First Passage Time Computation in Tagged GSPNs with Queue Places , 2011, Comput. J..

[15]  Gábor Horváth,et al.  A tool support for automatic analysis based on the tagged customer approach , 2006, Third International Conference on the Quantitative Evaluation of Systems - (QEST'06).

[16]  Souheib Baarir,et al.  The GreatSPN tool: recent enhancements , 2009, PERV.