performance analysis of stochastic process algebra models
play

Performance analysis of Stochastic Process Algebra models using - PowerPoint PPT Presentation

Sep 21, 2023 •325 likes •751 views

Performance analysis of Stochastic Process Algebra models using Stochastic Simulation Jeremy Bradley Stephen Gilmore Nigel Thomas Email: jb@doc.ic.ac.uk stephen.gilmore@ed.ac.uk nigel.thomas@ncl.ac.uk Department of Computing, LFCS, School

  1. Performance analysis of Stochastic Process Algebra models using Stochastic Simulation Jeremy Bradley Stephen Gilmore Nigel Thomas Email: jb@doc.ic.ac.uk stephen.gilmore@ed.ac.uk nigel.thomas@ncl.ac.uk Department of Computing, LFCS, School of Computing Science, Imperial College London University of Edinburgh Univerity of Newcastle Produced with prosper and L A T EX JTB [18/07/2005] – p. 1/21

  2. The story used to be... Passage-time PDF hydra ipc ✏✏✏✏ ✶ PEPA HYDRA Passage-time CDF ✲ ✲ PPPP q Transient For state spaces of less than O (10 9 ) Very precise probabilistic results JTB [18/07/2005] – p. 2/21

  3. Now the story is... Stochastic simulation Dizzy ipc/pwb ✏✏✏✏ ✶ PEPA Rate equations ✲ PPPP q Numerical ODE solution For very large state spaces, e.g. 10 1000 + states Aggregate deterministic results JTB [18/07/2005] – p. 3/21

  4. Stochastic Process Algebra PEPA syntax: P ✄ ✁ P ::= (a , λ ) . P P + P L P P / L A JTB [18/07/2005] – p. 4/21

  5. Stochastic Process Algebra PEPA syntax: P ✄ ✁ P ::= (a , λ ) . P P + P L P P / L A Action prefix: (a , λ ) . P JTB [18/07/2005] – p. 4/21

  6. Stochastic Process Algebra PEPA syntax: P ✄ ✁ P ::= (a , λ ) . P P + P L P P / L A Action prefix: (a , λ ) . P Competitive choice: P 1 + P 2 JTB [18/07/2005] – p. 4/21

  7. Stochastic Process Algebra PEPA syntax: P ✄ ✁ P ::= (a , λ ) . P P + P L P P / L A Action prefix: (a , λ ) . P Competitive choice: P 1 + P 2 Cooperation: P 1 ✄ ✁ L P 2 JTB [18/07/2005] – p. 4/21

  8. Stochastic Process Algebra PEPA syntax: P ✄ ✁ P ::= (a , λ ) . P P + P L P P / L A Action prefix: (a , λ ) . P Competitive choice: P 1 + P 2 Cooperation: P 1 ✄ ✁ L P 2 Action hiding: P / L JTB [18/07/2005] – p. 4/21

  9. Stochastic Process Algebra PEPA syntax: P ✄ ✁ P ::= (a , λ ) . P P + P L P P / L A Action prefix: (a , λ ) . P Competitive choice: P 1 + P 2 Cooperation: P 1 ✄ ✁ L P 2 Action hiding: P / L Constant label: A JTB [18/07/2005] – p. 4/21

  10. PEPA: Example def (AA ✄ { run } A1) ✄ ✁ { alert } (BB ✄ ✁ ✁ Sys = { run } B1) JTB [18/07/2005] – p. 5/21

  11. PEPA: Example def (AA ✄ { run } A1) ✄ ✁ { alert } (BB ✄ ✁ ✁ Sys = { run } B1) def AA = (run , ⊤ ) . (alert , r 5 ) . AA JTB [18/07/2005] – p. 5/21

  12. PEPA: Example def (AA ✄ { run } A1) ✄ ✁ { alert } (BB ✄ ✁ ✁ Sys = { run } B1) def AA = (run , ⊤ ) . (alert , r 5 ) . AA def A1 = (start , r 1 ) . A2 + (pause , r 2 ) . A3 def A2 = (run , r 3 ) . A1 + (fail , r 4 ) . A3 def A3 = (recover , r 1 ) . A1 JTB [18/07/2005] – p. 5/21

  13. PEPA: Example def (AA ✄ { run } A1) ✄ ✁ { alert } (BB ✄ ✁ ✁ Sys = { run } B1) def AA = (run , ⊤ ) . (alert , r 5 ) . AA def A1 = (start , r 1 ) . A2 + (pause , r 2 ) . A3 def A2 = (run , r 3 ) . A1 + (fail , r 4 ) . A3 def A3 = (recover , r 1 ) . A1 def BB = (run , ⊤ ) . (alert , r 5 ) . BB JTB [18/07/2005] – p. 5/21

  14. PEPA: Example def (AA ✄ { run } A1) ✄ ✁ { alert } (BB ✄ ✁ ✁ Sys = { run } B1) def AA = (run , ⊤ ) . (alert , r 5 ) . AA def A1 = (start , r 1 ) . A2 + (pause , r 2 ) . A3 def A2 = (run , r 3 ) . A1 + (fail , r 4 ) . A3 def A3 = (recover , r 1 ) . A1 def BB = (run , ⊤ ) . (alert , r 5 ) . BB def B1 = (start , r 1 ) . B2 + (pause , r 2 ) . B1 def B2 = (run , r 3 ) . B1 JTB [18/07/2005] – p. 5/21

  15. Types of Analysis Steady-state and transient analysis in PEPA: def 0.05 A1 = (start , r 1 ) . A2 + (pause , r 2 ) . A3 Steady state: X_1 0.045 def 0.04 A2 = (run , r 3 ) . A1 + (fail , r 4 ) . A3 0.035 ⇒ def 0.03 A3 = (recover , r 1 ) . A1 Probability 0.025 def AA = (run , ⊤ ) . (alert , r 5 ) . AA 0.02 0.015 AA ✄ ✁ def 0.01 Sys = { run } A1 0.005 0 0 5 10 15 20 25 30 Time, t JTB [18/07/2005] – p. 6/21

  16. Types of Analysis Steady-state and transient analysis in PEPA: def 0.05 A1 = (start , r 1 ) . A2 + (pause , r 2 ) . A3 PEPA model: transient X_1 -> X_1 Steady state: X_1 0.045 def 0.04 A2 = (run , r 3 ) . A1 + (fail , r 4 ) . A3 0.035 ⇒ def 0.03 A3 = (recover , r 1 ) . A1 Probability 0.025 def AA = (run , ⊤ ) . (alert , r 5 ) . AA 0.02 0.015 AA ✄ ✁ def 0.01 Sys = { run } A1 0.005 0 0 5 10 15 20 25 30 Time, t JTB [18/07/2005] – p. 6/21

  17. Types of Analysis Steady-state and transient analysis in PEPA: def 0.05 A1 = (start , r 1 ) . A2 + (pause , r 2 ) . A3 PEPA model: transient X_1 -> X_1 Steady state: X_1 0.045 def 0.04 A2 = (run , r 3 ) . A1 + (fail , r 4 ) . A3 0.035 ⇒ def 0.03 A3 = (recover , r 1 ) . A1 Probability 0.025 def AA = (run , ⊤ ) . (alert , r 5 ) . AA 0.02 0.015 AA ✄ ✁ def 0.01 Sys = { run } A1 0.005 0 0 5 10 15 20 25 30 Time, t JTB [18/07/2005] – p. 6/21

  18. Types of Analysis Steady-state and transient analysis in PEPA: def 0.05 A1 = (start , r 1 ) . A2 + (pause , r 2 ) . A3 PEPA model: transient X_1 -> X_1 Steady state: X_1 0.045 def 0.04 A2 = (run , r 3 ) . A1 + (fail , r 4 ) . A3 0.035 ⇒ def 0.03 A3 = (recover , r 1 ) . A1 Probability 0.025 def AA = (run , ⊤ ) . (alert , r 5 ) . AA 0.02 0.015 AA ✄ ✁ def 0.01 Sys = { run } A1 0.005 0 0 5 10 15 20 25 30 Time, t JTB [18/07/2005] – p. 6/21

  19. Types of Analysis Steady-state and transient analysis in PEPA: def 0.05 A1 = (start , r 1 ) . A2 + (pause , r 2 ) . A3 PEPA model: transient X_1 -> X_1 Steady state: X_1 0.045 def 0.04 A2 = (run , r 3 ) . A1 + (fail , r 4 ) . A3 0.035 ⇒ def 0.03 A3 = (recover , r 1 ) . A1 Probability 0.025 def AA = (run , ⊤ ) . (alert , r 5 ) . AA 0.02 0.015 AA ✄ ✁ def 0.01 Sys = { run } A1 0.005 0 0 5 10 15 20 25 30 Time, t JTB [18/07/2005] – p. 6/21

  20. Passage-time Quantiles Extract a passage-time density from a PEPA model: def A1 = (start , r 1 ) . A2 + (pause , r 2 ) . A3 def A2 = (run , r 3 ) . A1 + (fail , r 4 ) . A3 ⇒ def A3 = (recover , r 1 ) . A1 def AA = (run , ⊤ ) . (alert , r 5 ) . AA AA ✄ ✁ def Sys = { run } A1 JTB [18/07/2005] – p. 7/21

  21. Example of aggregate states def = ( compute , ⊤ ) . Client 1 Client def = ( delay , µ ) . Client Client 1 def = ( compute , λ ) . Server 1 Server def = ( recover , ν ) . Server Server 1 ) ✄ ✁ Sys = ( Client � · · · � Client { compute } ( Server � · · · � Server ) � �� � � �� � N M Cooperating clusters can be represented as tuples JTB [18/07/2005] – p. 8/21

  22. Rate Equation Translation Action: delay JTB [18/07/2005] – p. 9/21

  23. Rate Equation Translation Action: delay n ( Client 1) µ Client 1 − − − − − − − → Client JTB [18/07/2005] – p. 9/21

  24. Rate Equation Translation Action: delay n ( Client 1) µ Client 1 − − − − − − − → Client Action: recover n ( Server 1) ν − − − − − − − → Server Server 1 JTB [18/07/2005] – p. 9/21

  25. Rate Equation Translation Action: delay n ( Client 1) µ Client 1 − − − − − − − → Client Action: recover n ( Server 1) ν − − − − − − − → Server Server 1 Action: compute θ ( n ( Client )) n ( Server ) λ Client + Server − − − − − − − → Client 1 + Server 1 where θ ( x ) = 1 if x > 0 , else 0 . JTB [18/07/2005] – p. 9/21

  26. Why the θ function? There are N client cpts enabling a compute action There are M server cpts enabling a compute action Overall compute rate is: r compute ( Sys ) = min( N ⊤ , Mλ ) JTB [18/07/2005] – p. 10/21

  27. Why the θ function? There are N client cpts enabling a compute action There are M server cpts enabling a compute action Overall compute rate is: r compute ( Sys ) = min( N ⊤ , Mλ ) If N = 0 then overall rate is 0 , hence: r compute ( Sys ) = θ ( N ) Mλ JTB [18/07/2005] – p. 10/21

  28. Dizzy setup JTB [18/07/2005] – p. 11/21

  29. Dizzy simulation JTB [18/07/2005] – p. 12/21

  30. Voter example Election _ Preparation ✄ ✁ L Electoral _ Personae def Voter 0[ N ] ✄ ✁ Electoral _ Personae = M Electoral _ App def Electoral _ App Collector _ 0[ N ] � Counter _ 1[ N ] = � Administrator [ N ] JTB [18/07/2005] – p. 13/21

  31. Early voter description def Voter 0 = ( choose , c 1 ) . Voter 0 _ 1 def Voter 0 _ 1 ( bitcommit , b 1 ) . Voter 0 _ 2 = def Voter 0 _ 2 = ( blind 1 , b 2 ) . Voter 0 _ 3 def Voter 0 _ 3 = ( blind 2 , b 3 ) . Voter 0 _ 4 def Voter 0 _ 4 = ( voter _ sign , s 1 ) . Voter 0 _ 5 def Voter 0 _ 5 ( sendA , s 2 ) . Voter 0 _ 5 b = def Voter 0 _ 5 b = ( sendV , ⊤ ) . Voter 1 def Voter 1 = ( unblind 1 , u 1 ) . Voter 1 _ 1 JTB [18/07/2005] – p. 14/21

  32. Voter: early stage Number of Voter components in derivative states 10000 Voter0 Voter0_4 Voter0_5b 8000 Voter1 6000 Number 4000 2000 0 0 5 10 15 20 25 30 Time, t JTB [18/07/2005] – p. 15/21

  33. High-level voter description Voter 0 def = ( choose , c 1 ) . . . ( sendV , ⊤ ) . Voter 1 JTB [18/07/2005] – p. 16/21

  34. High-level voter description Voter 0 def = ( choose , c 1 ) . . . ( sendV , ⊤ ) . Voter 1 Voter 1 def = ( unblind , u 1 ) . . . ( sendC , s 6 ) . Voter 2 JTB [18/07/2005] – p. 16/21

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

quancol . ........ . . . ... ... ... ... ... ... ... Stochastic Process Algebras

quancol . ........ . . . ... ... ... ... ... ... ... Stochastic Process Algebras

Stochastic Process Algebras Modelling in a Data Rich World ProPPA Inference Results Conclusions Integrating Inference with Stochastic Process Algebra Models Jane Hillston School of Informatics, University of Edinburgh 11th January 2018

1.48k views • 104 slides
Modelling network performance with a spatial stochastic process algebra Vashti Galpin Laboratory

Modelling network performance with a spatial stochastic process algebra Vashti Galpin Laboratory

Introduction Motivation Locations Syntax Semantics Measuring performance Conclusion Modelling network performance with a spatial stochastic process algebra Vashti Galpin Laboratory for Foundations of Computer Science University of

1.07k views • 81 slides
Modelling network performance with a spatial stochastic process algebra Vashti Galpin Laboratory

Modelling network performance with a spatial stochastic process algebra Vashti Galpin Laboratory

Introduction Motivation Syntax and semantics Example Other approaches Conclusion Modelling network performance with a spatial stochastic process algebra Vashti Galpin Laboratory for Foundations of Computer Science University of Edinburgh

1.28k views • 102 slides
Towards a spatial stochastic process algebra Vashti Galpin Laboratory for Foundations of Computer

Towards a spatial stochastic process algebra Vashti Galpin Laboratory for Foundations of Computer

Introduction Syntax Semantics Applications Example Conclusion Towards a spatial stochastic process algebra Vashti Galpin Laboratory for Foundations of Computer Science University of Edinburgh 31 July 2008 Vashti Galpin Towards a spatial

469 views • 22 slides
Stochastic and deterministic analysis of models of defects in discrete systems Andrea Braides

Stochastic and deterministic analysis of models of defects in discrete systems Andrea Braides

Stochastic and deterministic analysis of models of defects in discrete systems Andrea Braides (Roma Tor Vergata ) Mathematical challenges motivated by multi-phase materials: analytic, stochastic and discrete aspects Anogia, June 26 2009 A

441 views • 26 slides
EC3062 ECONOMETRICS LINEAR STOCHASTIC MODELS Let { x +1 , x +2 , . . . , x + n } denote n

EC3062 ECONOMETRICS LINEAR STOCHASTIC MODELS Let { x +1 , x +2 , . . . , x + n } denote n

EC3062 ECONOMETRICS LINEAR STOCHASTIC MODELS Let { x +1 , x +2 , . . . , x + n } denote n consecutive elements from a stochas- tic process. If their joint distribution does not depend on , regardless of the size of n , then the process

313 views • 27 slides
Density dependent transmission from process algebra models of disease spread Introduction

Density dependent transmission from process algebra models of disease spread Introduction

Density dependent transmission from process algebra models of disease spread Introduction Traditional differential equation SIR models take into account population level behaviours. E.g. Kermack-McKendrick dS = SI dt dI =

318 views • 29 slides
Stochastic Processes, Kernel Regression, Infinite Mixture Models Gabriel Huang (TA for Simon

Stochastic Processes, Kernel Regression, Infinite Mixture Models Gabriel Huang (TA for Simon

Stochastic Processes, Kernel Regression, Infinite Mixture Models Gabriel Huang (TA for Simon Lacoste-Julien) IFT 6269 : Probabilistic Graphical Models - Fall 2018 Stochastic Process = Random Function 2 Today Motivate Gaussian and

1.13k views • 79 slides
Outlines Stochastic Process Discrete Time Markov Chain (DTMC) 2 Stochastic Process

Outlines Stochastic Process Discrete Time Markov Chain (DTMC) 2 Stochastic Process

Markov Chains (1) Outlines Stochastic Process Discrete Time Markov Chain (DTMC) 2 Stochastic Process { ( )| } X t t T A stochastic process is a family of random variables , defined on a given probability space, indexed by

401 views • 12 slides
Performance modelling with UML and stochastic process algebras Stephen Gilmore Laboratory for

Performance modelling with UML and stochastic process algebras Stephen Gilmore Laboratory for

I V N E U R S E I H T Y T O H F G R E U D B I N Performance modelling with UML and stochastic process algebras Stephen Gilmore Laboratory for Foundations of Computer Science The University of Edinburgh, Scotland Joint

690 views • 30 slides
Option Pricing with Long Memory Stochastic Volatility Models Zhigang Tong September 27, 2012

Option Pricing with Long Memory Stochastic Volatility Models Zhigang Tong September 27, 2012

Option Pricing with Long Memory Stochastic Volatility Models Zhigang Tong September 27, 2012 Stochastic Differential Equation Let X ( t ) be a stochastic process and suppose that there exists a real number x (0) and two processes ( t ) and

577 views • 18 slides
Lecture on advanced volatility models Erik Lindstrm Stochastic Volatility (SV) Let r t be a

Lecture on advanced volatility models Erik Lindstrm Stochastic Volatility (SV) Let r t be a

Lecture on advanced volatility models Erik Lindstrm Stochastic Volatility (SV) Let r t be a stochastic process. The log returns (observed) are given by r t = exp ( V t / 2 ) z t . The volatility V t is a hidden AR process V t = + V

399 views • 23 slides
Spectral Analysis of Stationary Stochastic Process Hanxiao Liu hanxiaol@cs.cmu.edu February 20,

Spectral Analysis of Stationary Stochastic Process Hanxiao Liu hanxiaol@cs.cmu.edu February 20,

Spectral Analysis of Stationary Stochastic Process Hanxiao Liu hanxiaol@cs.cmu.edu February 20, 2016 1 / 16 Outline Stationarity The time-frequency dual Spectral representation Marginal/conditional dependencies Inference 2

336 views • 16 slides
Efficient Analysis of Dynamical Properties in Stochastic Chemical Kinetic Models Hiroyuki

Efficient Analysis of Dynamical Properties in Stochastic Chemical Kinetic Models Hiroyuki

Efficient Analysis of Dynamical Properties in Stochastic Chemical Kinetic Models Hiroyuki Kuwahara Lane Center for Computational Biology Carnegie Mellon University CMACS April 2, 2010 Hiroyuki Kuwahara Efficient Analysis of Dynamical

573 views • 53 slides
cours ARO07MSSD #4 Random Models of Dynamical Systems Introduction to SDEs Stochastic

cours ARO07MSSD #4 Random Models of Dynamical Systems Introduction to SDEs Stochastic

Stochastic differential equations Solution as a Markov process cours ARO07MSSD #4 Random Models of Dynamical Systems Introduction to SDEs Stochastic differential equations Fran cois Le Gland INRIA Rennes + IRMAR

977 views • 51 slides
EC3062 ECONOMETRICS IDENTIFICATION OF ARMA MODELS A stationary stochastic process can be

EC3062 ECONOMETRICS IDENTIFICATION OF ARMA MODELS A stationary stochastic process can be

EC3062 ECONOMETRICS IDENTIFICATION OF ARMA MODELS A stationary stochastic process can be characterised, equivalently, by its autocovariance function or its partial autocovariance function. It can also be characterised by is spectral density

438 views • 32 slides
Beba BEhavioural BAsed forwarding Giuseppe Bianchi OpenFlows platform The SDN/OpenFlow Model

Beba BEhavioural BAsed forwarding Giuseppe Bianchi OpenFlows platform The SDN/OpenFlow Model

Data Plane Programmability the next step in SDN Giuseppe Bianchi CNIT / University of Roma Tor Vergata Credits to: M. Bonola, A. Capone, C. Cascone, S. Pontarelli, D. Sanvito, M. Spaziani Brunella, V. Bruschi EU Support: Beba BEhavioural

797 views • 34 slides
NEPR208 - Adaptation properties and mechanisms Functional advantages in properties of a neural

NEPR208 - Adaptation properties and mechanisms Functional advantages in properties of a neural

NEPR208 - Adaptation properties and mechanisms Functional advantages in properties of a neural code and changes in those properties What is adaptation? Why do neural systems have a particular nonlinear and filter? Why does the nonlinearity and

931 views • 38 slides
Software Testing Testing 1 Background Main objectives of a project: High Quality & High

Software Testing Testing 1 Background Main objectives of a project: High Quality & High

Software Testing Testing 1 Background Main objectives of a project: High Quality & High Productivity (Q&P) Quality has many dimensions reliability, maintainability, interoperability etc. Reliability is perhaps the most

1.46k views • 100 slides
Pretty Good Democracy Peter Y A Ryan University of Luxembourg Vanessa Teague University of

Pretty Good Democracy Peter Y A Ryan University of Luxembourg Vanessa Teague University of

Pretty Good Democracy Peter Y A Ryan University of Luxembourg Vanessa Teague University of Melbourne Fribourg 6 September 2010 P Y A Ryan Pretty Good Democracy 1 Outline The challenge Pretty Good Democracy Threats

780 views • 26 slides
Getting started on the cluster Learning Objectives Describe the structure of a compute cluster

Getting started on the cluster Learning Objectives Describe the structure of a compute cluster

Getting started on the cluster Learning Objectives Describe the structure of a compute cluster Log in to the cluster Demonstrate how to start an interactive session with the SLURM job scheduler 2 Cluster Architecture 3 Cluster Terminology

616 views • 14 slides
Parallel Processing Raul Queiroz Feitosa Parts of these slides are from the support material

Parallel Processing Raul Queiroz Feitosa Parts of these slides are from the support material

Parallel Processing Raul Queiroz Feitosa Parts of these slides are from the support material provided by W. Stallings Objective To present the most prominent approaches to parallel computer organization. 2 Parallel Processing Outline

1.22k views • 84 slides
Energy issues of GPU computing clusters Stphane Vialle SUPELEC UMI GT CNRS 2958 &

Energy issues of GPU computing clusters Stphane Vialle SUPELEC UMI GT CNRS 2958 &

AlGorille INRIA Project Team Energy issues of GPU computing clusters Stphane Vialle SUPELEC UMI GT CNRS 2958 & AlGorille INRIA Project Team EJC 19 20/11/2012 Lyon, France What means using a GPU cluster ? Programming a

627 views • 34 slides
Tiny GPU Cluster for Big Spatial Data: A Preliminary Performance Evaluation Jianting Zhang 1,2

Tiny GPU Cluster for Big Spatial Data: A Preliminary Performance Evaluation Jianting Zhang 1,2

Tiny GPU Cluster for Big Spatial Data: A Preliminary Performance Evaluation Jianting Zhang 1,2 Simin You 2 , Le Gruenwald 3 1 Depart of Computer Science, CUNY City College (CCNY) 2 Department of Computer Science, CUNY Graduate Center 3 School

476 views • 19 slides

More recommend