Towards Reliable Modelling with Stochastic Process Algebras

In this thesis, we investigate reliable modelling within a stochastic process algebra framework. Primarily, we consider issues of variance in stochastic process algebras as a measure of model reliability. This is in contrast to previous research in the eld which has tended to centre around mean behaviour and steady-state solutions. We present a method of stochastic aggregation for analysing generally-distributed processes. This allows us more descriptive power in representing stochastic systems and thus gives us the ability to create more accurate models. We improve upon two well-developed Markovian process algebras and show how their simpler paradigm can be brought to bear on more realistic synchronisation models. Now, reliable performance gures can be obtained for systems, where previously only approximations of unknown accuracy were possible. Finally, we describe reliability de nitions and variance metrics in stochastic models and demonstrate how systems can be made more reliable through careful combination under stochastic process algebra operators. iii

[1]  G. J. A. Stern,et al.  Queueing Systems, Volume 2: Computer Applications , 1976 .

[2]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[3]  Michael K. Molloy.  Performance Analysis Using Stochastic Petri Nets , 1982, IEEE Transactions on Computers.

[4]  R. Syski,et al.  Fundamentals of Queueing Theory , 1999, Technometrics.

[5]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

[6]  C. Priami.  Stochastic -calculus with General Distributions , 1996 .

[7]  Matteo Sereno.  Towards a Product Form Solution for Stochastic Process Algebras , 1995, Comput. J..

[8]  Boudewijn R. Haverkort,et al.  Stochastic Event Structures for the Decomposition of Stochastic Process Algebra Models , 1999 .

[9]  Graham Clark.  Stochastic Process Algebra Structure for Insensitivity , 1999 .

[10]  M. Kwiatkowska,et al.  Solving Infinite Stochastic Process Algebra Models Through Matrix-Geometric Methods , 1999 .

[11]  Faron Moller,et al.  A Temporal Calculus of Communicating Systems , 1990, CONCUR.

[12]  M. Rumsewicz,et al.  INSENSITIVITY WITH AGE-DEPENDENT ROUTING , 1989 .

[13]  Stephen Gilmore,et al.  Feature interaction in PEPA , 1998 .

[14]  Ron Koymans,et al.  Specifying real-time properties with metric temporal logic , 1990, Real-Time Systems.

[15]  D. Kendall.  Some Problems in the Theory of Queues , 1951 .

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

[17]  Vincent Hodgson,et al.  The Single Server Queue. , 1972 .

[18]  Jeremy T. Bradley,et al.  Reliable Performance Modelling with Approximate Synchronisations , 1999 .

[19]  Jeremy T. Bradley,et al.  An Aggregation Technique for Analysing Some Generally Distributed Stochastic Processes , 1999 .

[20]  Jane Hillston,et al.  Product Form Solution for a Class of PEPA Models , 1999, Perform. Evaluation.

[21]  David R. Cox,et al.  The Theory of Stochastic Processes , 1967, The Mathematical Gazette.

[22]  James A. McHugh,et al.  Algorithmic Graph Theory , 1986 .

[23]  Ina Schieferdecker.  Verifying performance oriented properties of TIS specifications , 1993 .

[24]  Jan A. Bergstra,et al.  Real time process algebra , 1991, Formal Aspects of Computing.

[25]  Stephen Gilmore,et al.  The PEPA Workbench: A Tool to Support a Process Algebra-based Approach to Performance Modelling , 1994, Computer Performance Evaluation.

[26]  Diego Latella,et al.  A Stochastic Causality-Based Process Algebra , 1995, Comput. J..

[27]  Marco Ajmone Marsan,et al.  Performance models of multiprocessor systems , 1987, MIT Press series in computer systems.

[28]  Marco Ajmone Marsan,et al.  A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems , 1984, TOCS.

[29]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[30]  Michael Rettelbach.  Probabilistic Branching in Markovian Process Algebras , 1995, Comput. J..

[31]  Peter G. Harrison,et al.  Exploiting Quasi-reversible Structures in Markovian Process Algebra Models , 1995, Comput. J..

[32]  William Henderson,et al.  Aggregation and Disaggregation Through Insensitivity in Stochastic Petri Nets , 1993, Perform. Evaluation.

[33]  Stephen Gilmore,et al.  Applying Quasi-Separability to Markovian Process Algebra , 1998 .

[34]  Fabrice Valois,et al.  Performance modelling of hierarchical cellular networks using PEPA , 2002, Performance evaluation (Print).

[35]  Christoph Lindemann,et al.  Performance Modelling with Deterministic and Stochastic Petri Nets , 1998, PERV.

[36]  Robin Milner,et al.  Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

[37]  Laurence A. Baxter,et al.  Probability, Statistics, and Queueing Theory With Computer Sciences Applications (2nd ed.) , 1992 .

[38]  Howard Bowman,et al.  Analysis of a Multimedia Stream using Stochastic Process Algebra , 2001, Comput. J..

[39]  Robert B. Cooper,et al.  Queueing systems, volume II: computer applications : By Leonard Kleinrock. Wiley-Interscience, New York, 1976, xx + 549 pp. , 1977 .

[40]  J. Hillston.  The nature of synchronisation , 1994 .

[41]  P. Harrison.  Laplace Transform Inversion and Passage-Time Distributions in Markov Processes , 1990 .

[42]  Holger Hermanns,et al.  Priority and maximal progress are completely axiomatisable , 1998 .

[43]  W. Henderson.  Insensitivity and reversed Markov processes , 1983 .

[44]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..

[45]  Mario Bravetti,et al.  Towards Performance Evaluation with General Distributions in Process Algebras , 1998, CONCUR.

[46]  Marco Ajmone Marsan,et al.  On Petri nets with deterministic and exponentially distributed firing times , 1986, European Workshop on Applications and Theory of Petri Nets.

[47]  M. Bravetti,et al.  GSMPA : A Core Calculus With Generally Distributed Durations 1 , 1998 .

[48]  J. Keilson.  The Ergodic Queue Length Distribution for Queueing Systems with Finite Capacity , 1966 .

[49]  H. Hermanns,et al.  Syntax , Semantics , Equivalences , and Axioms for MTIPP y , 1994 .

[50]  Jeremy T. Bradley,et al.  A Note on the Proof of Reduction of Biconnected Digraphs to Normal Forms , 1999 .

[51]  Roberto Gorrieri,et al.  Theory and Application of Extended Markovian Process Algebra , 2011 .

[52]  J. Hillston.  Compositional Markovian Modelling Using a Process Algebra , 1995 .

[53]  Adam Wolisz,et al.  An integrated approach to the design of communication protocols , 1993, 1993 4th Workshop on Future Trends of Distributed Computing Systems.

[54]  Paul Adrien Maurice Dirac,et al.  Bakerian Lecture - The physical interpretation of quantum mechanics , 1942, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.

[55]  Nigel Thomas.  Extending Quasi-separability , 1999 .

[56]  D. Cox.  The analysis of non-Markovian stochastic processes by the inclusion of supplementary variables , 1955, Mathematical Proceedings of the Cambridge Philosophical Society.

[57]  E. J. Watson.  Laplace transforms and applications , 1980 .

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

[59]  Carl M. Harris,et al.  Fundamentals of queueing theory (2nd ed.). , 1985 .

[60]  Holger Hermanns,et al.  A Stochastic Process Algebra Based Modelling Tool , 1996 .

[61]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[62]  A Syntactical Analysis of Reversible PEPA , 1998 .

[63]  D. Cox.  A use of complex probabilities in the theory of stochastic processes , 1955, Mathematical Proceedings of the Cambridge Philosophical Society.

[64]  Norbert Götz,et al.  TIPP - Introduction and Application to Protocol Performance Analysis , 1992, FBT.

[65]  J. Jackson.  Wiley Series in Probability and Mathematical Statistics , 2004 .

[66]  Ronald A. Howard,et al.  Dynamic Programming and Markov Processes , 1960 .

[67]  Kishor S. Trivedi.  Probability and Statistics with Reliability, Queuing, and Computer Science Applications , 1984 .

[68]  Stephen Gilmore,et al.  A Feature Construct for PEPA , 1999 .

[69]  Marco Ajmone Marsan,et al.  A LOTOS extension for the performance analysis of distributed systems , 1994, TNET.

[70]  Jane Hillston,et al.  A Compositional Approach to Performance Modelling (Distinguished Dissertations in Computer Science) , 2005 .

[71]  Holger Hermanns,et al.  Formal Characterisation of Immediate Actions in SPA with Nondeterministic Branching , 1995, Comput. J..

[72]  Peter Buchholz.  Markovian process algebra: Composition and equiva-lence , 1994 .

[73]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[74]  Roberto Gorrieri,et al.  Extended Markovian Process Algebra , 1996, CONCUR.

[75]  Holger Hermanns,et al.  Interactive Markov Chains , 2002, Lecture Notes in Computer Science.

[76]  Robert Holton,et al.  A PEPA Specification of an Industrial Production Cell , 1995, Comput. J..

[77]  Leonard Kleinrock,et al.  Queueing Systems: Volume I-Theory , 1975 .

[78]  Jeremy T. Bradley,et al.  Measuring Improved Reliability in Stochastic Systems , 1999 .