Numerically representing stochastic process algebra models

Computer Journal

Volumn 55, Issue 11, 2012, Pages 1383-1397

  Ding, Jie ^a,b   Hillston, Jane ^c  

^a YANGZHOU UNIVERSITY   (China)

^b BEIHANG UNIVERSITY   (China)

^c UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

compact state representation; numerical representation; PEPA; state space representation; stochastic process algebra

Indexed keywords

NUMERICAL REPRESENTATION; PEPA; STATE REPRESENTATION; STATE SPACE REPRESENTATION; STOCHASTIC PROCESS ALGEBRAS;

ALGEBRA; COMPUTER PROGRAMMING LANGUAGES; MATHEMATICAL MODELS; STATE SPACE METHODS;

RANDOM PROCESSES;

EID: 84868585401     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxs013     Document Type: Article

References (28)

1. Hillston, J. (1996) A compositional approach to performance modelling. PhD Thesis, Cambridge University Press.
2. Hermanns, H. (1998) Interactive Markov chains. PhD Thesis, Universität Erlangen-Nürnberg, Germany.
3. Bernardo, M. and Gorrieri, R. (1998) A tutorial on EMPA: a theory of concurrent processes with nondeterminism, priorities, probabilities and time. Theor. Comput. Sci., 202, 1-54.
4. D'Argenio, P.R., Hermanns, H., Katoen, J.-P. and Klaren, R. (2001) MoDeST: A Modelling and Description Language for Stochastic Timed Systems. In deAlfaro, L. and Gilmore, S. (eds), Proc. Joint Int. Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification, London, UK, Lecture Notes in Computer Science 2165, pp. 87-104. Springer.
5. Hillston, J. (2005) Fluid Flow Approximation of PEPA Models. Proceedings of the Second International Conference on the Quantitative Evaluation of Systems, Washington, DC, USA, pp. 33-43. IEEE Computer Society.
6. Tribastone, M., Gilmore, S. and Hillston, J. (2012) Scalable differential analysis of process algebra models. IEEE Trans. Softw. Eng., 38, 205-219.
7. Tribastone, M., Ding, J., Gilmore, S. and Hillston, J. (2011) Fluid rewards for a stochastic process algebra. IEEE Trans. Softw. Eng., 99, 1.
8. Gilmore, S., Hillston, J. and Ribaudo, M. (2001) An efficient algorithm for aggregating PEPA models. IEEE Trans. Softw. Eng., 27, 449-464.
9. Usenko, Y. (2002) Linearization in μCRL. PhD Thesis, Eindhoven University of Technology.
10. Groote, J., Ponse, A. and Usenko, Y. (2001) Linearization in parallel pCRL. J. Log. Algebr. Program., 48, 39-70.
11. van den Brand, P., Renier, M. and Cuijpers, P. (2006) Linearization of hybrid processes. J. Log. Algebr. Program., 68, 54-104.
12. Ribaudo, M. (1995) Stochastic Petri Net Semantics for Stochastic Process Algebras. Proceedings of the Sixth International Workshop on Petri Nets and Performance Models, Durham, NC, USA, pp. 148-157. IEEE Computer Society.
13. Bernardo, M., Busi, N. and Ribaudo, M. (2000) Compact Net Semantics for Process Algebras. In Bolognesi, T. and Latella, D. (eds.), Proc. IFIP Joint Int. Conf. Formal Description Techniques for Distributed Systems and Communication Protocols and Protocol Specification, Testing and Verification (FORTE/PSTV 2000), Pisa, Italy, pp. 319-334. Kluwer.
14. Bernardo, M., Busi, N. and Ribaudo, M. (2002) Integrating TwoTowers and GreatSPN through a compact net semantics. Perform. Eval., 50, 153-187.
15. Brualdi, R.A. (1998) Introductory Combinatorics (3rd edn). Prentice Hall.
16. Bradley, J.T., Gilmore, S.T. and Hillston, J. (2008) Analysing distributed internet worm attacks using continuous state-space approximation of process algebra models. J. Comput. Syst. Sci., 74, 1013-1032.
17. Ding, J. (2010) Structural and fluid analysis of large scale PEPA models-with applications to content adaptation systems. PhD Thesis, The Univeristy of Edinburgh. http://www.dcs.ed.ac.uk/pepa/jie-ding-thesis.pdf.
18. Lautenbach, K. (1987) Linear Algebraic Techniques for Place/Transition Nets. Proc. an Advanced Course on Petri Nets: Central Models and Their Properties, London, UK, Lecture Notes in Computer Science 254, pp. 142-167. Springer.
19. Silva, M., Teruel, E. and Colom, J.M. (1996) Linear Algebraic and Linear Programming Techniques for the Analyisis of Place/Transition Net Systems. Lectures on Petri Nets: Basic Models, Lecture Notes in Computer Science 1491. Springer.
20. Colom, J.M., Teruel, E. and Silva, M. (1998) Logical properties of P/T system and their analysis. MATCH Summer School (Spain).
21. Ding, J. and Hillston, J. (2010) Structural Analysis for Stochastic Process Algebra Models (Invited Paper). Proc. 13th Int. Conf. Algebraic Methodology and Software Technology (AMAST2010), Manoir St-Castin Québec, Canada, Lecture Notes in Computer Science 6486, pp. 1-27. Springer, Berlin/Heidelberg.
22. Asmussen, S. and Glynn, P.W. (2007) Stochastic Simulation: Algorithms and Analysis, Stochastic Modelling and Applied Probability 57. Springer.
23. Norris, J. (1998) Markov Chains. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press.
24. Bolch, G., Greiner, S., d. Meer, H. and Trivedi, K.S. (1998) Queueing Networks and Markov Chains: Modelling and Performance Evaluation with Computer Science Application. John Wiley & Sons, INC.
25. Kurtz, T.G. (1970) Solutions of ordinary differential equations as limits of pure jump Markov processes. J. Appl. Probab., 7, 49-58.
26. Ethier, S.N. and Kurtz, T.G. (1986) Markov Processes: Characterization and Convergence. John Wiley & Sons, Inc.
27. Geisweiller, N., Hillston, J. and Stenico, M. (2008) Relating continuous and discrete PEPA models of signalling pathways. Theor. Comput. Sci., 404, 97-111.
28. Ding, J. and Hillston, J. (2010) Fundamental results of fluid approximations of PEPA models. http://arxiv.org/abs/1008.4754.