research-article

Open access

Formal techniques for performance analysis: blending SAN and PEPA

Authors:

Leïla KloulAuthors Info & Claims

Formal Aspects of Computing, Volume 19, Issue 1

Pages 3 - 33

https://doi.org/10.1007/s00165-006-0011-6

Published: 01 March 2007 Publication History

Abstract

In this paper we consider two performance modelling techniques from the perspectives of model construction, generation of an underlying continuous time Markov process, and the potential for reduction in the Markov process. Such careful comparison of modelling techniques allows us to appreciate the strengths and weaknesses of different approaches, and facilitates cross-fertilization between them. In the present case we take a characteristic of one formalism, functional rates in Stochastic Automata Networks, and introduce it to the other formalism, Performance Evaluation Process Algebra. We investigate the benefits of this cross-fertilization, particularly from the perspectives of Markov process generation and reduction.

References

References

[1]

Ajmone Marsan M, Conte G, and Balbo G A class of generalised stochastic petri nets for the performance evaluation of multiprocessor systems ACM Trans Comput Syst 1984 2 2 93-122

Digital Library

[2]

Benoit A, Brenner L, Fernandes P, Plateau B, Stewart W (2003) The PEPS software tool. In: Proceedings of the 13th international conference on modelling techniques and tools for computer performance evaluation, Illinois, September 2–7 2003, pp 215–234

[3]

Benoit A, Brenner L, Fernandes P, Plateau B (2003) Aggregation of stochastic automata networks with replicas. In: Proceedings of the international conference on the numerical solution of markov chains (NSMC’03), Illinois, September 2–7 2003, pp 215–234

[4]

Bernardo M and Gorrieri R A tutorial on EMPA: a theory of concurrent processes with nondeterminism, priorities, probabilities and time Theor Comput Sci 1998 202 1-54

Digital Library

[5]

Buchholz P and Kemper P Efficient computation and representation of large reachability sets of composed automata Dis Event Dynam Syst: Theor Appl 2002 12 265-286

Digital Library

[6]

Bortolussi L (2006) Stochastic concurrent constraint programming. In: Proceedings of workshop on quantitative analysis of programming languages (QAPL) Vienna, April 2006

[7]

Buchholz P (1994) Compositional analysis of a markovian process algebra. In: Herzog U, Rettelbach M (eds) Proceedings of the 2nd process algebra and performance modelling workshop

[8]

Buchholz P Hierarchical structuring of superposed GSPNs IEEE Trans Softw Eng 1999 25 2 166-181

Digital Library

[9]

Clark G, Gilmore S, Hillston J, and Thomas N Experiences with the PEPA performance modelling tools IEE Softw 1999 146 1 11-19

[10]

Ciardo C, Tilgner M (1996) On the use of Kronecker operators for the solution of generalized stochastic Petri nets. Technical Report 96-35, Institute for Computer Applications in Science and Engineering, Hampton, VA, May 1996

[11]

Ciardo G, Miner AS (1999) A data structure for the efficient kronecker solution of gspns. In: In P. Buchholz editor, Proc. of the 8th International Workshop on Petri Nets and Performance Models (PNPM’99), Saragoza, Spain, pp 22–31

[12]

Dayar T Iterative methods based on splittings for stochastic automata networks Eur J Oper Res 1998 110 166-186

[13]

Donatelli S, Hermanns H, Hillston J, and Ribaudo M Baccelli F, Jean-Marie A, and Mitrani I GSPN and SPA compared in practice: modelling a distributed mail system Quantitative methods in parallel systems. 1995 Berlin Heidelberg New York Springer 38-51

[14]

D’Argenio P, Hermanns H, Katoen J-P, Klaren R (2001) MoDeST – a modelling and description language for stochastic timed systems. In: Process algebra and probabilistic methods, performance modeling and verification: Joint international workshop, PAPM-PROBMIV, Aachen, Germany, September 2001. LNCS, vol 2165, pp 87–104. Springer, Berlin Heidelberg New York

[15]

Donatelli S, Hillston J, Ribaudo M (1995) A comparison of performance evaluation process algebra and generalized stochastic Petri nets. In: Proceedings of the 6th Petri Nets and Performance Models Workshop, October 1995, pp 158–168. IEEE Computer Society Press

[16]

DiPierro A, Hankin C, Wiklicky H (2004) Continuous-time probabilistic KLAIM. In: Proceedings of SECCO 2004, Electronic Notes in Theoretical Computer Science

[17]

Donatelli S and Kemper P Integrating synchronization with priority into a kronecker representation Perform Evaluat 2001 44 1–4 73-96

Digital Library

[18]

DeNicola R, Latella D, Massink M (2005) Formal modelling and quantitative analysis of KLAIM-based mobile systems. In: Proceedings of SAC’05

[19]

Donatelli S (1994) Superposed generalised stochastic Petri nets: definition and efficient solution. In: Silva M (ed) Proceedings of the 15th international conference on application and theory of Petri nets

[20]

Fourneau JM, Kloul L, Valois F (2000) Performance evaluation of a hierarchical cellular network using PEPA. Technical Report RR 2000/2, Laboratoire PRiSM, University of Versailles

[21]

Fourneau JM, Kloul L, and Valois F Performance evaluation of a hierarchical cellular network using PEPA Perform Evaluat 2002 50 83-99

Digital Library

[22]

Fernando P, Plateau B, and Atif K Efficient descriptor–vector multiplications in stochastic automata networks JACM 1998 3 381-414

Digital Library

[23]

Fernando P, Plateau B, Stewart WJ (1996) Numerical iusses for stochastic automata networks. In: Ribaudo M, (ed) Proceedings of the fourth process algebra and performance modelling workshop, pp 215–234. CLUT

[24]

Gilmore S, Hillston J, Kloul L, and Ribaudo M PEPA nets: a structured performance modelling formalism Perform. Evaluat 2003 54 2 79-104

Digital Library

[25]

Götz N, Herzog U, Rettelbach M (1993) Multiprocessor and distributed system design: the integration of functional specification and performance analysis using stochastic process algebras. In: Performance’93

[26]

Gilmore S, Hillston J, Recalde L (1997) Elementary structural analysis for PEPA. Technical Report ECS-LFCS-97-377, Laboratory for Foundations of Computer Science, Department of Computer Science, The University of Edinburgh

[27]

Gilmore S, Hillston J, and Ribaudo M An efficient algorithm for aggregating PEPA models IEEE Trans Softw Eng 2001 27 5 449-464

Digital Library

[28]

Groote JF and Ponse A Ponse A, Verhoef C, and van Vlijmen SFM The syntax and semantics of μ CRL Algebra of communicating processes ’94, workshops in computing series. 1995 Berlin Heidelberg New York Springer 26-62

[29]

Hermanns H (1999) Interactive Markov chains. PhD thesis, Erlangen-Nurnberg University

[30]

Hillston J (1994) A Compositional Approach to Performance Modelling. Phd. Thesis, University of Edinburgh, 1994

[31]

Hillston J (1995) Compositional Markovian modelling using a process algebra. In: Stewart WJ, (ed) Numerical solution of Markov chains. Kluwer

[32]

Hillston J (2005) Fluid flow approximation of pepa models. In: Second international conference on the quantitative evaluation of systems, Torino, Italy, September 2005, pp 33–42. IEEE Computer Society Press

[33]

Hillston J (2005) Tuning systems: from composition to performance. Comput J. The Needham Lecture

[34]

Hillston J, Kloul L (2001) An efficient kronecker representation for pepa models. In: Proceedings of the joint international workshop, PAPM-PROBMIV 2001, LNCS, vol 2165, pp 120–135, Aachen, Germany. Springer, Berlin Heidelberg New York

[35]

Hillston J, Kloul L (2006) A function-equivalent components based simplification technique for pepa models. In: Horváth A, Telek M (eds) Formal methods and stochastic models for performance evaluation, Third European performance engineering workshop (EPEW) Budapest, Hungary, June 21–22 2006. LNCS, vol 4054, pp 16–30. Springer, Berlin Heidelberg New York

[36]

Henderson W, Pearce CEM, Taylor PG, and van Dijk NM Closed queueing networks with batch services Que Sys 1990 6 59-70

Digital Library

[37]

Hillston J, Recalde L, Ribaudo M, Silva M (2001) A comparison of the expressiveness of SPA and bounded SPN models. In: Haverkort B, German R (eds) Proceedings of the 9th international workshop on Petri nets and performance models, Aachen, Germany, September 2001. IEEE Computer Science Press

[38]

Henderson W and Taylor PG Product form in networks of queues with batch arrivals and batch services Que Syst 1990 6 71-88

Digital Library

[39]

Hillston J and Thomas N Product form for a class of PEPA models Perform Evaluat 1999 35 171-192

Digital Library

[40]

ISO/IEC JTCI/SC33. ISO/IEC FCD 15437—Enhancements to LOTOS, May 1998

[41]

Jacobson S and Lazowska E Analysing queueing networks with simultaneous resource possession Commun ACM, 1982 25 2 142-151

Digital Library

[42]

Kemper P Numerical Analysis of Superposed GSPNs IEEE Trans Softw Eng 1996 22 9 615-628

Digital Library

[43]

Kwiatkowska M, Norman G, Parker D (2002) PRISM: Probabilistic symbolic model checker. In: Proceedings of 12th international conference on modelling tools and techniques for computer and communication system performance evaluation, London, UK, April 2002. LNCS, vol 2324, pp 200–204. Springer, Berlin Heidelberg New York

[44]

Molloy MK Performance analysis using stochastic petri nets IEEE Trans Comput 1982 31 9 913-917

Digital Library

[45]

Plateau B, Fourneau JM (1991) A methodology for solving markov models of parallel systems. J Parallel Distrib Comput

[46]

Plateau B, Fourneau JM, Lee KH (1988) PEPS: a package for solving complex Markov models of parallel systems. In: Proceedings of the 4th international conference on modelling techniques and tools for computer performance evaluation

[47]

Plateau B (1984) De l’Evolution du Parallélisme et de la Synchronisation. PhD Thesis, Université de Paris-Sud, Orsay

[48]

Plateau B (1985) On the stochastic structure of parallelism and synchronisation models for distributed algorithms. In: Proceedings of the ACM sigmetrics conference on measurement and modelling of computer systems

[49]

Priami C (1995) Stochastic π-calculus. Comput J 38(6). Special Issue: Proceedings of the 3rd process algebra and performance modelling workshop

[50]

Ribaudo M (1995) On the relationship between stochastic petri nets and stochastic process algebras. PhD Thesis, Dipartimento di Informatica, Università di Torino, May 1995

[51]

Stewart WJ, Atif K, and Plateau B The numerical solution of stochastic automata networks Euro J Oper Res 1995 86 503-525

[52]

Sanders WH and Meyer JF Reduced base model construction methods for stochastic activity networks IEEE J Select Areas Commun 1991 9 1 25-36

Digital Library

Cited By

Papadopoulos CLi JO'Kelly M(2019)A classification and review of timed Markov models of manufacturing systemsComputers and Industrial Engineering10.1016/j.cie.2018.12.019128:C(219-244)Online publication date: 1-Feb-2019
https://dl.acm.org/doi/10.1016/j.cie.2018.12.019
Šnipas MRadziukynas VValakevičius E(2017)Modeling reliability of power systems substations by using stochastic automata networksReliability Engineering & System Safety10.1016/j.ress.2016.08.006157(13-22)Online publication date: Jan-2017
https://doi.org/10.1016/j.ress.2016.08.006
(2017)Marking dependency in non-Markovian stochastic Petri netsPerformance Evaluation10.1016/j.peva.2017.03.001110:C(22-47)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1016/j.peva.2017.03.001
Show More Cited By

Recommendations

Hybrid semantics for Bio-PEPA

This paper investigates the stochastic, continuous and instantaneous (hybrid) modelling of systems defined in Bio-PEPA, a quantitative process algebra for biological modelling. This is achieved by mapping a Bio-PEPA model to a model in stochastic HYPE, ...
Improved Continuous Approximation of PEPA Models through Epidemiological Examples

We present two individual based models of disease systems using PEPA (Performance Evaluation Process Algebra). The models explore contrasting mechanisms of disease transmission: direct transmission (e.g. measles) and indirect transmission (e.g. malaria, ...
Software performance modelling using PEPA nets

Modelling and analysing distributed and mobile software systems is a challenging task. PEPA nets---coloured stochastic Petri nets---are a recently introduced modelling formalism which clearly capture important features such as location, synchronisation ...

Comments

Information & Contributors

Information

Published In

cover image Formal Aspects of Computing

Formal Aspects of Computing Volume 19, Issue 1

Mar 2007

132 pages

ISSN:0934-5043

EISSN:1433-299X

Issue’s Table of Contents

© British Computer Society 2006.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 March 2007

Accepted: 16 August 2006

Revision received: 19 July 2004

Received: 25 November 2002

Published in FAC Volume 19, Issue 1

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
48
Total Downloads

Downloads (Last 12 months)38
Downloads (Last 6 weeks)3

Reflects downloads up to 25 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Papadopoulos CLi JO'Kelly M(2019)A classification and review of timed Markov models of manufacturing systemsComputers and Industrial Engineering10.1016/j.cie.2018.12.019128:C(219-244)Online publication date: 1-Feb-2019
https://dl.acm.org/doi/10.1016/j.cie.2018.12.019
Šnipas MRadziukynas VValakevičius E(2017)Modeling reliability of power systems substations by using stochastic automata networksReliability Engineering & System Safety10.1016/j.ress.2016.08.006157(13-22)Online publication date: Jan-2017
https://doi.org/10.1016/j.ress.2016.08.006
(2017)Marking dependency in non-Markovian stochastic Petri netsPerformance Evaluation10.1016/j.peva.2017.03.001110:C(22-47)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1016/j.peva.2017.03.001
Fernandes PLopes LYeralan S(2013)Symbolic Solution of Kronecker-Based Structured Markovian ModelsProceedings of the 2013 IEEE 21st International Symposium on Modelling, Analysis & Simulation of Computer and Telecommunication Systems10.1109/MASCOTS.2013.62(409-413)Online publication date: 14-Aug-2013
https://dl.acm.org/doi/10.1109/MASCOTS.2013.62
Fernandes PO’Kelly MPapadopoulos CSales A(2013)Analysis of exponential reliable production lines using Kronecker descriptorsInternational Journal of Production Research10.1080/00207543.2012.75455051:14(4240-4257)Online publication date: Jul-2013
https://doi.org/10.1080/00207543.2012.754550
Hillston J(2013)Challenges for Quantitative Analysis of Collective Adaptive Systems8th International Symposium on Trustworthy Global Computing - Volume 835810.1007/978-3-319-05119-2_2(14-21)Online publication date: 30-Aug-2013
https://dl.acm.org/doi/10.1007/978-3-319-05119-2_2
Fernandes PO’Kelly MPapadopoulos CSales A(2013)Exact Analysis of Discrete Part Production Lines: The Markovian Queueing Network and the Stochastic Automata Networks FormalismsHandbook of Stochastic Models and Analysis of Manufacturing System Operations10.1007/978-1-4614-6777-9_3(73-113)Online publication date: 1-Apr-2013
https://doi.org/10.1007/978-1-4614-6777-9_3
Czekster RFernandes PWebber T(2011)Efficient vector-descriptor product exploiting time-memory trade-offsACM SIGMETRICS Performance Evaluation Review10.1145/2160803.216080539:3(2-9)Online publication date: 21-Dec-2011
https://dl.acm.org/doi/10.1145/2160803.2160805
Braghetto KFerreira JVincent JMcGraw RImsand EChinni M(2010)Performance analysis modeling applied to business processesProceedings of the 2010 Spring Simulation Multiconference10.1145/1878537.1878665(1-8)Online publication date: 11-Apr-2010
https://dl.acm.org/doi/10.1145/1878537.1878665
Czekster RFernandes PWebber T(2009)GTAexpressProceedings of the 2009 Sixth International Conference on the Quantitative Evaluation of Systems10.1109/QEST.2009.26(281-282)Online publication date: 13-Sep-2009
https://dl.acm.org/doi/10.1109/QEST.2009.26
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Media

Figures

Other

Tables

View Issue’s Table of Contents