Compositional performance modelling with the TIPPtool

Stochastic process algebras have been proposed as compositional specification formalisms for performance models. In this paper, we describe a tool which aims at realising all beneficial aspects of compositional performance modelling, the TIPPtool. It incorporates methods for compositional specification as well as solution, based on state-of-the-art techniques, and wrapped in a user-friendly graphical front end. Apart from highlighting the general benefits of the tool, we also discuss some lessons learned during development and application of the TIPPtool. A non-trivial model of a real life communication system serves as a case study to illustrate benefits and limitations.

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

[2]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[3]  Gianni Conte,et al.  PERFORMANCE ANALYSIS OF MULTIPROCESSOR SYSTEMS , 1985 .

[4]  J. Davenport.  Editor , 1960 .

[5]  Ulrich Herzog,et al.  Stochastic process algebras as a tool for performance and dependability modelling , 1995, Proceedings of 1995 IEEE International Computer Performance and Dependability Symposium.

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

[7]  Christel Baier,et al.  Polynomial Time Algorithms for Testing Probabilistic Bisimulation and Simulation , 1996, CAV.

[8]  Herbert A. Simon,et al.  Aggregation of Variables in Dynamic Systems , 1961 .

[9]  Markus Siegle.  Compact representation of large performability models based on extended BDDs , 1998 .

[10]  Norbert Götz,et al.  Multiprocessor and Distributed System Design: The Integration of Functional Specification and Performance Analysis Using Stochastic Process Algebras , 1993, Performance/SIGMETRICS Tutorials.

[11]  K. Mani Chandy,et al.  Parametric Analysis of Queuing Networks , 1975, IBM J. Res. Dev..

[12]  Holger Hermanns,et al.  Priority and Maximal Progress Are Completely Axioatisable (Extended Abstract) , 1998, CONCUR.

[13]  Scott A. Smolka,et al.  CCS expressions, finite state processes, and three problems of equivalence , 1983, PODC '83.

[14]  Peter G. Harrison,et al.  Stochastic Process Algebra for Discrete Event Simulation , 1995 .

[15]  William J. Stewart,et al.  Introduction to the numerical solution of Markov Chains , 1994 .

[16]  Joost-Pieter Katoen,et al.  Automated compositional Markov chain generation for a plain-old telephone system , 2000, Sci. Comput. Program..

[17]  Jane Hillston.  Proceedings of the 2nd Workshop on Process Algebra and Performance Modelling , 1994 .

[18]  Michael Rettelbach.  Stochastische Prozessalgebren mit zeitlosen Aktivitäten und probabilistischen Verzweigungen , 1996 .

[19]  François Baccelli,et al.  Quantitative Methods in Parallel Systems , 1995, Esprit Basic Research Series.

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

[21]  E. Brinksma,et al.  An Algebraic Approach to the Speciication of Stochastic Systems (extended Abstract) , 1998 .

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

[23]  Norbert Götz,et al.  Stochastische Prozessalgebren: Integration von funktionalem Entwurf und Leistungsbewertung Verteilter Systeme , 1994 .

[24]  Manuel Silva Suárez,et al.  Throughput approximation of decision free processes using decomposition , 1997, PNPM.

[25]  Nadia Tawbi,et al.  Specification and Verification of the PowerScaleTM Bus Arbitration Protocol: An Industrial Experiment with LOTOS , 1996, FORTE.

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

[27]  Joost-Pieter Katoen,et al.  An algebraic approach to the specification of stochastic systems , 1998, PROCOMET.

[28]  Alain Kerbrat,et al.  CADP - A Protocol Validation and Verification Toolbox , 1996, CAV.

[29]  Robert E. Milne,et al.  The formal description technique LOTOS : By P.H.J. van Eijk, C.A. Vissers and M. Diaz, eds. North-Holland, Amsterdam, Netherlands, 1989, Price $102.50 (hardback), ISBN 0-444-87267-1. , 1990 .

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

[31]  Satish K. Tripathi,et al.  Automated time scale decomposition and analysis of stochastic Petri nets , 1993, Proceedings of 5th International Workshop on Petri Nets and Performance Models.

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

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

[34]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[35]  Vassilis Mertsiotakis,et al.  Approximate analysis methods for stochastic process algebras , 1998 .

[36]  BolognesiTommaso,et al.  Introduction to the ISO specification language LOTOS , 1987 .

[37]  Scott A. Smolka,et al.  CCS expressions, finite state processes, and three problems of equivalence , 1983, PODC '83.

[38]  Alain Kerbrat,et al.  Protocol verification with the ALDÉBARAN toolset , 1997, International Journal on Software Tools for Technology Transfer.

[39]  Stephen Gilmore,et al.  Process Algebras and their Application to Performance Modelling: Proceedings of the Third Workshop on Process Algebra and Performance Modelling Edinburgh, Scotland , 1995, Comput. J..

[40]  Holger Hermanns,et al.  Bisimulation Algorithms for Stochastic Process Algebras and Their BDD-Based Implementation , 1999, ARTS.

[41]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[42]  Corrado Priami,et al.  Stochastic pi-Calculus , 1995, Comput. J..

[43]  R. F. Brown,et al.  PERFORMANCE EVALUATION , 2019, ISO 22301:2019 and business continuity management – Understand how to plan, implement and enhance a business continuity management system (BCMS).

[44]  Holger Hermanns,et al.  Stochastic Process Algebras - Between LOTOS and Markov Chains , 1998, Comput. Networks.

[45]  Rance Cleaveland,et al.  TwoTowers: A Tool Integrating Functional and Performance Analysis of Concurrent Systems , 1998, FORTE.

[46]  V. Mersiotakis,et al.  Throughput approximation of decision free processes using decomposition , 1997, Proceedings of the Seventh International Workshop on Petri Nets and Performance Models.

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

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

[49]  Jeffrey P. Buzen,et al.  Response Time Preservation: A general technique for developing approximate algorithms for queueing networks , 1984, SIGMETRICS '84.

[50]  Franz Hartleb,et al.  Performance Evaluation of Parallel Programs - Modeling and Monitoring with the Tool PEPP , 1993, MMB.

[51]  Manuel Silva Suárez,et al.  Approximate Throughput Computation of Stochastic Marked Graphs , 1994, IEEE Trans. Software Eng..

[52]  Markus Siegle,et al.  Technique and tool for symbolic representation and manipulation of stochastic transition systems , 1998, Proceedings. IEEE International Computer Performance and Dependability Symposium. IPDS'98 (Cat. No.98TB100248).

[53]  Diego Latella,et al.  Partial Order Models for Quantitative Extensions of LOTOS , 1998, Comput. Networks.

[54]  Ulrich Herzog,et al.  Formal Description, Time and Performance Analysis. A Framework , 1990, Entwurf und Betrieb verteilter Systeme.

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

[56]  Iso. Lotos,et al.  A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour , 1985 .

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

[58]  Holger Hermanns,et al.  Gspn and Spa Compared in Practice Modelling a Distributed Mail System , 1995 .

[59]  Arturo Azcorra,et al.  Tool Support to Implement LOTOS Formal Specifications , 1993, Comput. Networks ISDN Syst..

[60]  Robert E. Tarjan,et al.  Three Partition Refinement Algorithms , 1987, SIAM J. Comput..