Tuning systems: From composition to performance

Computer Journal

Volumn 48, Issue 4, 2005, Pages 385-400

  Hillston, Jane ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS; MARKOV PROCESSES; MATHEMATICAL MODELS; NUMERICAL ANALYSIS; PERFORMANCE;

PERFORMANCE ANALYSIS; PERFORMANCE EVALUATION PROCESS ALGEBRA (PEPA) PROJECT; PERFORMANCE MODELLING;

SYSTEMS ANALYSIS;

EID: 25844471537     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/bxh097     Document Type: Article

References (84)

1. Milner, R. (1989) Communication and Concurrency. Prentice-Hall.
2. Hoare, C. A. R. (1985) Communicating Sequential Processes. Prentice-Hall.
3. Plotkin, G. D. (1981) A structural approach to operational semantics. Technical Report DAIMI FN-19, University of Aarhus.
4. Herzog, U. (1990) Formal description, time and performance analysis: A framework. Technical Report 15/90, IMMD VII, Friedrich-Alexander-Universität, Erlangen-Nürnberg, Germany.
5. Hillston, J. (1996) A Compositional Approach to Performance Modelling. Cambridge University Press.
6. Götz, N., Herzog, U. and Rettelbach, M. (1992) TIPP - a language for timed processes and performance evaluation. Technical Report 4/92, IMMD7, University of Erlangen- Nürnberg, Germany.
7. Bernardo, M. and Gorrieri, R. (1998) A tutorial on EMPA: A theory of concurrent processes with nondet erminism, priorities, probabilities and time. TCS, 202, 1-54.
8. Strulo, B. and Harrison, P.G. (2000) Spades - a process algebra for discrete event simulation. J. Logic Comput., 10(1), 3-42.
9. Hillston, J. (1994) The nature of synchronisation. In Herzog, U. and Rettelbach, M. (eds) Proc. 2nd Int. Workshop on Process Algebras and Performance Modelling, Erlangen, July, pp. 51-70.
10. Bradley, J. (1999) Towards Reliable Modelling with Stochastic Process Algebras. PhD thesis, Department of Computer Science, University of Bristol.
11. Larsen, K. and Skou, A. (1991) Bisimulation through probabilistic testing. Inform. Comput., 94(1), 1-28.
12. Kemeny, J. G. and Snell, J. L. (1960) Finite Markov Chains. Van Nostrand.
13. Clark, G. (2000) Techniques for the Construction and Analysis of Algebraic Performance Models. PhD thesis, The University of Edinburgh.
14. Hillston, J. (1995) Compositional markovian modelling using a process algebra. In Stewart, W. J. (ed) Numerical Solution of Markov Chains. Kluwer.
15. Gilmore, S., Hillston, J. and Ribaudo, M. (2001) An efficient algorithm for aggregating PEPA models. IEEE Trans. Software Eng., 27(5),449-464.
16. Deavours, D. D. and Sanders, W. H. (1998) An efficient disk-based tool for solving large Markov models. Perform. Evaluation, 33, 67-84.
17. Hillston, J. and Kloul, L. (2001) An efficient Kronecker representation for PEPA models. In de Alfaro, L. and Gilmore, S. (eds) Proc. First Joint PAPM-PROBMIV Workshop, Aachen, Germany, September 12-14, LNCS 2165, Springer-Verlag.
18. Hermanns, H., Meyer-Kayser, J. and Siegle, M. (1999) Multi-terminal binary decision diagrams to represent and analyse continuous time Markov chains. In Proc. 3rd Int. Workshop on the Numerical Solution of Markov Chains, Zaragoza, Spain, September 6-10, pp. 188-207.
19. Hillston, J. (2001) Exploiting structure in solution: Decomposing composed models, FMPA Lecture Notes. Springer-Verlag.
20. Jackson, J. R. (1963) Jobshop-like queueing systems. Manage. Sci., 10, 131-142.
21. Baskett, F., Chandy, K. M., Muntz, R. R. and Palacios, F. G. (1975) Open, closed and mixed networks of queues with different classes of customers. J. ACM, 22(2), 248-260.
22. Bhabuta, M., Harrison, P. G. and Kanani, K. (1995) Detecting reversibility in Markovian Process Algebra. In Performance Engineering of Computer and Telecommunications Systems Liverpool John Moores University, Springer-Verlag.
23. Hillston, J. and Thomas, N. (1998) A syntactical analysis of reversible PEPA models. In Proc. 6th Process Algebra and Performance Modelling Workshop, Nice, France, September 11-12. University of Verona.
24. Kelly, F. (1979) Reversibility and Stochastic Processes. Wiley.
25. Harrison, P. and Hillston, J. (1995) Exploiting quasi-reversible structures in Markovian process algebra models. Comput. J., 38(6), 510-520.
26. Sereno, M. (1995) Towards a product form solution of stochastic process algebras. Comput. J, 38(6), 622-632.
27. Henderson, W. and Taylor, P. G. (1991) Embedded processes in stochastic petri nets. IEEE Trans. Softw. Eng., 17(2), 108-116.
28. Boucherie, R. J. (1994) A Characterisation of Independence for Competing Markov Chains with Applications to Stochastic Petri Nets. IEEE Trans. Softw. Eng., 20(7), 536-544.
29. Hillston, J. and Thomas, N. (1999) Product form solution for a class of PEPA models. Perform. Evaluation, 35(3-4), 171-192.
30. Clark, G. and Hillston, J. (2002) Product form solution for an insensitive stochastic process algebra structure. Perform. Evaluation, 50(2-3), 129-151.
31. Mitrani, I. and Wright, P. E. (1994) Routing in the presence of breakdowns. Perform. Evaluation, 20, 151-164.
32. Thomas, N. and Gilmore, S. (1998) Applying quasi-separability to markovian process algebra. In Proc. 6th Process Algebra and Performance Modelling Workshop, Nice, France, September 11-12. University of Verona.
33. Harrison, P. G. (2003) Turning back time in Markovian process algebra. TCS, 290, 1947-1986.
34. Gelenbe, E. (1991) Queueing networks with negative and positive customers. J Appl. Probab., 28, 656-663.
35. Courtois, P. J. (1977) Decomposability: Queueing and Computer System Applications. ACM Series. Academic Press, New York.
36. Blakemore, A. and Tripathi, S. (1993) Automated time scale decomposition of SPNs. In Proc. of 5th International Workshop on Petri Nets and Performance Models (PNPM'93), Toulouse, October 20-22.
37. Hillston, J. and Mertsiotakis, V. (1995) A simple time scale decomposition technique for stochastic process algebras. Comput. J, 38(7), 566-577.
38. Mertsiotakis, V. (1998) Approximate Analysis Methods for Stochastic Process Algebras. PhD thesis, Universität Erlangen-Nürnberg, Martensstraße 3, 91058 Erlangen.
39. Mertsiotakis, V. and Silva, M. (1997) A throughput approximation algorithm for decision free processes. In Ribaudo, M. (ed.) Proc. 7th Int, Workshop on Petri Nets and Performance Models, St Malo, France, June 3-6.
40. Jungnitz, H. (1992) Approximation Methods for Stochastic Petri Nets. PhD thesis, Rensselaer Polytechnic Institute.
41. Bohnenkamp, H. and Haverkort, B. (1997) Decomposition methods for the solution of stochastic process algebra models: A proposal. In Brinksma, E. and Nymeyer, A. (eds) Proc. 5th Process Algebra and Performance Modelling Workshop, Enschede, The Netherlands, June 26-27.
42. Ciardo G. and Trivedi, K. S. (1992) A decomposition approach for stochastic petri net models. Perfor. Evaluation, 18, 37-59.
43. Bohnenkamp, H. and Haverkort, B. (1998) Semi-Numerical Solution of Stochastic Process Algebra Models. In Priami, C. (ed.) Proc. 6th Process Algebra and Performance Modelling Workshop, Nice, France, September 11-12.
44. Thomas, N. and Hillston, J. (1997) Using Markovian process algebra to specify interactions in queueing systems. Technical Report ECS-LFCS-97-373, LFCS, The University of Edinburgh.
45. Clark, G., Gilmore, S., Hillston, J. and Ribaudo, M. (2000) Exploiting modal logic to express performance measures. In Proc. 11th Int. Conf. Computer Performance Evaluation: Modelling Techniques and Tools, Schaumburg, Illinois, USA, March 27-31, LNCS 1786, pp. 211-227. Springer-Verlag.
46. Bowman, H., Bryans, J. and Derrick, J. (1999) Analysis of a multimedia stream using stochastic process algebra. In Priami, C. (ed.) 6th Int. Workshop on Process Algebras and Performance Modelling, Nice, France, September 11-12, pp. 51-69.
47. Dempster, E. W., Tomov, N. T., Lü, J., Pua, C. S., Williams, M. H., Burger, A., Taylor, H. and Broughton, P. (1998) Verifying a performance estimator for parallel DBMSs. In Proc. EuroPar (EuroPar'98), Southampton, September 2-4.
48. Bouzeghoub, M., Kloul, L. and Mokhtari, A. (2002) A new active network framework based on active rules. Technical Report 2002/21, PRiSM, Université de Versailles.
49. Hillston, J., Kloul, L. and Mokhtari, A. (2003) Active nodes performance analysis using PEPA. In Proc. l9th UK Performance Engineering Workshop, University of Warwick, July 9-10, pp. 244-256.
50. Hillston, J., Kloul, L. and Mokhtari, A. (2004) Towards a feasible active networking scenario. Telecommun. Sys., 27(2-4),413-438.
51. Gilmore, S., Hillston, J., Holton, D. R. W. and Rettelbach, M. (1996) Specifications in Stochastic Process Algebra for a Robot Control Problem. Int. J. Prod. Res., 34(4), 1065-1080.
52. Holton, D. R. W. (1995) A PEPA specification of an industrial production cell. Comput. J, 38(7), 542-551.
53. Forneau, J. M., Kloul, L. and Valois, F. (2002) Performance modelling of hierarchical cellular networks using PEPA. Perform. Evaluation, 50(2-3), 83-99.
54. Console, L., Picardi, C. and Ribaudo, M. (2000) Diagnosis and diagnosability analysis using process algebras. In Proc. 11th Int. Workshop on Principles of Diagnosis (DX00), Morelia, Mexico, June 8-11.
55. Gilmore, S. and Hillston, J. (1994) The PEPA workbench: A tool to support a process algebra-based approach to performance modelling. In Proc. 7th Int. Conf. on Modelling Techniques and Tools for Computer Performance Evaluation, Vienna, Austria, May 3-6, LNCS 794, pp. 353-368. Springer-Verlag.
56. Clark, G., Gilmore, S. and Hillston, J. (1999) The PEPA performance modelling tools. In Hillston, J. (ed.) Proc. 7th Workshop on Process Algebra and Performance Modelling, Zaragosa, Spain, September 6-10. University of Zaragosa Press.
57. Hunter, J. (1999) Re-evaluation of the PEPA Workbench. Master's thesis, School of Computer Science, The University of Edinburgh.
58. Gilmore, S., Hillston, J. and Ribaudo, M. (2002) PEPA nets: A structured performance modelling formalism. In Proc. 12th Int. Conf on Modelling Tools and Techniques for Computer and Communication System Performance Evaluation, London, UK, April 14-17, LNCS 2324, pp. 111-130, Springer-Verlag.
59. Wan, F. (2000) Interface Engineering and Transient Analysis for the PEPA Workbench. Master's thesis, School of Computer Science, The University of Edinburgh, UK.
60. Bradley, J. T, Dingle, N. J., Gilmore, S. T. and Knottenbelt, W. J. (2003) Derivation of passage-time densities in PEPA models using IPC: the imperial PEPA compiler. In Proc. 11th IEEE/ACM Int Symp. on Modeling, Analysis and Simulation of Computer and Telecommunications Systems, Orlando, FL, October 12-15, pp. 344-351. IEEE Computer Society Press.
61. Knottenbelt, W. J. (1996) Generalised Markovian analysis of timed transition systems. Master's thesis, University of Cape Town, South Aftica.
62. Bradley, J. T., Dingle, N. J., Gilmore, S. T. and Knottenbelt, W. J. (2003) Extracting passage times from PEPA models with the HYDRA tool: A case study. In Jarvis, S. (ed.) (2003) Proc. of 19th UK Performance Engineering Workshop, University of Warwick, July 9-10, pp. 79-90.
63. Argent-Katwala, A., Bradley, J. T. and Dingle, N. J. (2004) Expressing performance requirements using regular expressions to specify stochastic probes over process algebra models. In Proc. 4th Int. Workshop on Software and Performance, Redwood Shores, CA, January 14-16, pp. 49-58. ACM Press.
64. Kwiatkowska, M., Norman, G. and Parker, D. (2002) PRISM: Probabilistic symbolic model checker. In Proc. of 12th Int. Conf. on Modelling Tools and Techniques for Computer and Communication System Performance Evaluation, London, UK, April 14-17, LNCS 2324, pp. 200-204. Springer-Verlag.
65. Gilmore, S. and Kloul, L. (2003) A unified tool for performance modelling and prediction. In Proc. 22nd Int Conf. on Computer Safety, Reliability and Security (SAFECOMP2003), Potsdam, Germany, September 21-24, LNCS 2788, pp. 179-192. Springer-Verlag.
66. Gilmore, S., Hillston, J., Kloul, L. and Ribaudo, M. (2004). Software performance modelling using PEPA nets. In Proc. 4th Int. Workshop on Software and Performance, Redwood Shores, CA, January 14-16, pp. 13-24, ACM Press.
67. Clark, G., Courtney, T., Daly, D., Deavours, D., Derisavi, S., Doyle, J. M., Sanders, W. H. and Webster, P. (2001) The Möbius modeling tool. In Proc. 9th Int. Workshop on Petri Nets and Performance Models, Aachen, Germany, September 11-14, pp. 241-250.
68. Clark, G. and Sanders, W. H. (2001) Implementing a stochastic process algebra within the Möbius modeling framework. In de Alfaro, L. and Gilmore, S. (eds) Proc. First Joint PAPM-PROBMIV Workshop, Aachen, Germany, September 12-14, LNCS 2165, pp. 200-215. Springer-Verlag.
69. Canevet, C., Gilmore, S., Hillston, J., Prowse, M. and Stevens, P. (2003) Performance modelling with UML and stochastic process algebras. IEE Proc. Comput. Dig. Tech., 150(2), 107-120,
70. Mitchell, B. and Hillston, J. (2004) Analysing web service composition with PEPA. In Proc. 3rd Workshop on Process Algebras and Stochastically Timed Activities, Edinburgh, UK June 10- 11, pp. 33-44.
71. Benoit, A., Cole, M., Gilmore, S. and Hillston, J. (2005) Realistic performance evaluation of skeleton-based grid applications using the Network Weather Service. Comput. J. (to appear).
72. Gilmore, S., Hillston, J., Ribaudo, M. and Kloul, L. (2003) PEPA nets: A structured performance modelling formalism. Perform. Evaluation, 54(2), 79-104.
73. Ajmone Marsan, M., Balbo, G., Conte, G., Donatelli, S. and Franceschinis, G. (1995) Modelling with Generalized Stochastic Petri Nets. John Wiley.
74. Chiola, G., Dutheillet, C., Franceschinis, G. and Haddad, S. (1993) Stochastic well-formed colored nets and symmetric modeling applications. IEEE Trans. on Comput., 42(11), 1343-1360.
75. Gilmore, S., Hillston, J. and Kloul, L. (2004). PEPA nets. In Calzarossa, M. C. and Gelenbe, E. (eds) Performance Tools and Applications to Networked Systems: Revised Tutorial Lectures, LNCS 2965, pp. 311-335. Springer-Verlag.
76. Gilmore, S., Haenel, V, Hillston, J. and Kloul, L. (2004). PEPA nets in practice: Modelling a decentralised peer-to-peer emergency medial application. In Núũez, M. et al. (eds) Applying Formal Methods: Testing, Performance and M/E-Commerce, Proc. EPEW 2004, Toledo, Spain, September 30-October 2, LNCS 3236, pp. 262-277. Springer-Verlag.
77. Gilmore, S., Kloul, L. and Piazza, D. (2004) Modelling role-playing games using PEPA nets. In Proc. 19th Int. Symp.on Computer and Information Sciences (ISCIS 2004), Kemer-Antalya, Turkey, October 27-29, LNCS 3280, pp. 523-532. Springer-Verlag.
78. Benoit, A., Cole, M., Gilmore, S. and Hillston, J. (2005) Enhancing the effective utilisation of grid clusters by exploiting on-line performability analysis, In Proc. 2nd Grid Performability Workshop, 2005. to appear.
79. Soong, T. T. (1973) Random Differential Equations in Science and Engineering. Academic Press.
80. Oksendal, B. K. (2003) Stochastic Differential Equations. Springer.
81. Cho, K.-H., Shin, S.-Y, Kim, H.-W., Wolkenhauer, O., McFerran, B. and Kolch, W. (2003) Mathematical modeling of the influence of RKIP on the ERK signaling pathway. In Priami, C. (ed.) Computational Methods in Systems Biology (CSMB'03), Rovereto, Italy, February 24-26, LNCS 2602, pp. 127-141. Springer-Verlag.
82. Calder, M., Gilmore, S. and Hillston, J. (2004) Modelling the influence of RKIP on the ERK signaling pathway using the stochastic process algebra PEPA. In Proc. BioConcur'04, London, England, August 30.
83. Calder, M., Gilmore, S. and Hillston, J. (2005) Automatically deriving ODEs from process algebra models of signalling pathways. To appear in CMSB'05, Edinburgh, Scotland, April 3-5.
84. Buchholtz, M., Gilmore, S., Hillston, J. and Nielson, F. (2004) Securing statically-verified communications protocols against timing attacks. In Proc. 1st Int. Workshop on Practical Applications of Stochastic Modelling, Royal Society, London, September 4, pp. 61-79.