Fluid Rewards for a Stochastic Process Algebra

Reasoning about the performance of models of software systems typically entails the derivation of metrics such as throughput, utilization, and response time. If the model is a Markov chain, these are expressed as real functions of the chain, called reward models. The computational complexity of reward-based metrics is of the same order as the solution of the Markov chain, making the analysis infeasible when evaluating large-scale systems. In the context of the stochastic process algebra PEPA, the underlying continuous-time Markov chain has been shown to admit a deterministic (fluid) approximation as a solution of an ordinary differential equation, which effectively circumvents state-space explosion. This paper is concerned with approximating Markovian reward models for PEPA with fluid rewards, i.e., functions of the solution of the differential equation problem. It shows that (1) the Markovian reward models for typical metrics of performance enjoy asymptotic convergence to their fluid analogues, and that (2) via numerical tests, the approximation yields satisfactory accuracy in practice.

[1]  Jeremy T. Bradley,et al.  Extracting Response Times from Fluid Analysis of Performance Models , 2008, SIPEW.

[2]  Stephen Gilmore,et al.  Automatic extraction of PEPA performance models from UML activity diagrams annotated with the MARTE profile , 2008, WOSP '08.

[3]  Stephen Gilmore,et al.  Specifying Performance Measures for PEPA , 1999, ARTS.

[4]  Uri M. Ascher,et al.  Computer methods for ordinary differential equations and differential-algebraic equations , 1998 .

[5]  Kishor S. Trivedi,et al.  Composite Performance and Dependability Analysis , 1992, Perform. Evaluation.

[6]  David Goldsman,et al.  To batch or not to batch? , 2004, TOMC.

[7]  Mirco Tribastone,et al.  Scalable Differential Analysis of Large Process Algebra Models , 2010, 2010 Seventh International Conference on the Quantitative Evaluation of Systems.

[8]  M.D. Beaudry,et al.  PERFORMANCE RELATED RELIABILITY MEASURES FOR COMPUTING SYSTEMS , 1995, Twenty-Fifth International Symposium on Fault-Tolerant Computing, 1995, ' Highlights from Twenty-Five Years'..

[9]  William H. Sanders,et al.  A Unified Approach for Specifying Measures of Performance, Dependability and Performability , 1991 .

[10]  Hassan S. Bakouch,et al.  Probability, Markov chains, queues, and simulation , 2011 .

[11]  L. T. Wu,et al.  Operational models for the evaluation of degradable computing systems , 1982, SIGMETRICS '82.

[12]  Jane Hillston,et al.  Fluid flow approximation of PEPA models , 2005, Second International Conference on the Quantitative Evaluation of Systems (QEST'05).

[13]  J D Littler,et al.  A PROOF OF THE QUEUING FORMULA , 1961 .

[14]  Alessandro Aldini,et al.  Mixing logics and rewards for the component-oriented specification of performance measures , 2007, Theor. Comput. Sci..

[15]  John G. Kemeny,et al.  Finite Markov Chains. , 1960 .

[16]  S. Gilmore,et al.  The PEPA Eclipse Plug-in , 2008 .

[17]  Boudewijn R. Haverkort,et al.  Specification techniques for Markov reward models , 1993, Discret. Event Dyn. Syst..

[18]  John F. Meyer,et al.  On Evaluating the Performability of Degradable Computing Systems , 1980, IEEE Transactions on Computers.

[19]  J. Norris,et al.  Differential equation approximations for Markov chains , 2007, 0710.3269.

[20]  Boudewijn R. Haverkort,et al.  Performance of computer communication systems - a model-based approach , 1998 .

[21]  Stephen Gilmore,et al.  Automatic Translation of UML Sequence Diagrams into PEPA Models , 2008, 2008 Fifth International Conference on Quantitative Evaluation of Systems.

[22]  Patrick Billingsley,et al.  Probability and Measure. , 1986 .

[23]  Allan Clark,et al.  Partial Evaluation of PEPA Models for Fluid-Flow Analysis , 2008, EPEW.

[24]  Joost-Pieter Katoen,et al.  Formal Methods for Real-Time and Probabilistic Systems , 1999, Lecture Notes in Computer Science.

[25]  Adam Duguid,et al.  The PEPA eclipse plugin , 2009, PERV.

[26]  B. Nordstrom FINITE MARKOV CHAINS , 2005 .

[27]  Kishor S. Trivedi,et al.  Performability Analysis: Measures, an Algorithm, and a Case Study , 1988, IEEE Trans. Computers.

[28]  Allan Clark,et al.  Stochastic Process Algebras , 2007, SFM.

[29]  P. Pollett On a model for interference between searching insect parasites , 1990, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.

[30]  Jie Ding Structural and fluid analysis for large scale PEPA models - with applications to content adaptation systems , 2010 .

[31]  J. Little A Proof for the Queuing Formula: L = λW , 1961 .

[32]  James Ledoux,et al.  Markov property for a function of a Markov chain: A linear algebra approach , 2005 .

[33]  Mirco Tribastone,et al.  Scalable analysis of stochastic process algebra models , 2010 .

[34]  John F. Meyer,et al.  Performability: A Retrospective and Some Pointers to the Future , 1992, Perform. Evaluation.

[35]  Tunc Geveci,et al.  Advanced Calculus , 2014, Nature.

[36]  Jane Hillston,et al.  A compositional approach to performance modelling , 1996 .

[37]  Stephen Gilmore,et al.  Scalable Differential Analysis of Process Algebra Models , 2012, IEEE Transactions on Software Engineering.

[38]  Allan Clark,et al.  Formal Methods for Performance Evaluation , 2007 .