Process algebras for quantitative analysis

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2005, Pages 239-248

  Hillston, J ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENCY ANALYSIS; MATHEMATICAL PROCESS ALGEBRAS; PROCESS ALGEBRA; STOCHASTIC PROCESS ALGEBRAS;

CONCURRENCY CONTROL; MATHEMATICAL MODELS; PERFORMANCE; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES; STOCHASTIC PROGRAMMING;

ALGEBRA;

EID: 26844453706     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2005.35     Document Type: Conference Paper

References (50)

1. DEGAS project web pages http://www.omnys.it/degas/, 2005.
2. A. Argent-Katwala, J. Bradley, and N. Dingle. Expressing performance requirements using regular expressions to specify stochastic probes over process algebra models. In Proc. of 4th Int. Workshop on Software and Performance, pages 49-58, Redwood Shores, California, USA, Jan. 2004. ACM Press.
3. A. Aziz, K. Sanwal, V. Singhal, and R. Brayton. Verifying continuous-time Markov chains. In Proc. of 8th Int. Conference on Computer Aided Verification (CAV), volume 1102 of LNCS. Springer Verlag, 1996.
4. C. Baier, J.-P. Katoen, and H. Hermanns. Approximate symbolic model checking of continuous-time Markov chains. In International Conference on Concurrency Theory, volume 1664 of LNCS, pages 146-161. Springer-Verlag, 1999.
5. F. Baskett, K. Chandy, R. Muntz, and F. Palacios. Open, Closed and Mixed Networks of Queues with Different Classes of Customers. Journal of the ACM, 22(2):248-260, Apr. 1975.
6. M. Bernardo and R. Gorrieri. A tutorial on EMPA: a theory of concurrent processes with nondeterminism, priorities, probabilities and time. TCS, 202:1-54, 1998.
7. M. Bhabuta, P. Harrison, and K. Kanani. Detecting reversibility in Markovian Process Algebra. In Performance Engineering of Computer and Telecommunications Systems, Liverpool John Moores University, Sept. 1995. Springer-Verlag.
8. R. Boucherie. A Characterisation of Independence for Competing Markov Chains with Applications to Stochastic Petri Nets. IEEE Trans. on Software Engineering, 20(7):536-544, July 1994.
9. J. Bradley. Towards Reliable Modelling with Stochastic Process Algebras. PhD thesis, Department of Computer Science, University of Bristol, 1999.
10. M. Bravetti, M. Bernardo, and R. Gorrieri. From EMPA to GSMPA: Allowing for general distributions. In E. Brinksma and A. Nymeyer, editors, Proc. of the 5th Int. Workshop on Process Algebras and Performance Modeling (PAPM '97), pages 17-33, 1997.
11. M. Bravetti and R. Gorrieri. The theory of Interactive Generalized Semi-Markov Processes. Theoretical Computer Science, 282(1):5-32, June 2002.
12. C. Canevet, S. Gilmore, J. Hillston, M. Prowse, and P. Stevens. Performance modelling with UML and stochastic process algebras. IEE Proceedings: Computers and Digital Techniques, 150(2):107-120, Mar. 2003.
13. G. Clark. Techniques for the Construction and Analysis of Algebraic Performance Models. PhD thesis, The University of Edinburgh, 2000.
14. G. Clark, S. Gilmore, and J. Hillston. Specifying performance measures for PEPA. In J.-P. Katoen, editor, Proceedings of the Fifth International AMAST Workshop on Real-Time and Probabilistic Systems, number 1601 in LNCS, pages 211-227, Bamberg, Germany, May 1999. Springer-Verlag.
15. G. Clark and J. Hillston. Product form solution for an insensitive stochastic process algebra structure. Performance Evaluation, 50(2-3): 129-151, 2002.
16. P. D'Argenio. Algebras and Automata for Timed and Stochastic Systems. PhD thesis, Department of Computer Science, University of Twente, 1999.
17. P. D'Argenio, H. Hermanns, J.-P. Katoen, and R. Klaren. Modest - a modelling and description language for stochastic timed systems. In Proc. of Process Algebra and Probabilistic Methods. Performance Modeling and Verification. Joint International Workshop, PAPM-PROBMIV 2001, volume 2165 of LNCS. Springer-Verlag, 2001.
18. D. Deavours and W. Sanders. An efficient disk-based tool for solving large Markov models. Performance Evaluation, 33:67-84, 1998.
19. A. El-Rayes, M. Kwiatkowska, and S. Minton. Analysing performance of lift systems in PEPA. In Proc. of 12th UK Performance Engineering Workshop, pages 83-100, 1996.
20. E. Gelenbe. Queueing networks with negative and positive customers. Journal of Applied Probability, 28:656-663, 1991.
21. N. Götz, U. Herzog, and M. Rettelbach. TIPP - a language for timed processes and performance evaluation. Technical Report 4/92, IMMD7, University of Erlangen-Nürnberg, Germany, Nov. 1992.
22. P. Harrison. Turning back time in Markovian process algebra. TCS, 290:1947-1986, 2003.
23. P. Harrison and J. Hillston. Exploiting quasi-reversible structures in Markovian process algebra models. In Proc. of 3rd Int. Workshop on Process Algebras and Performance Modelling, pages 510-520.
24. Special Issue of The Computer Journal, 38(7), Dec. 1995.
25. B. Haverkort, L. Cloth, H. Hermanns, J.-P. Katoen, and C. Baier. Model checking performability properties. In Proc. of Int. Conf. on Dependable Systems and Networks (DSN'02). IEEE Computer Society Press, 2002.
26. H. Hermanns. Interactive Markov Chains. PhD thesis, IMMD7, Universität Erlangen-Nürnberg, 1998.
27. H. Hermanns, J. Meyer-Kayser, and M. Siegle. Multi-terminal binary decision diagrams to represent and analyse continuous time Markov chains. In Proc. of 3rd Intl. Workshop on the Numerical Solution of Markov Chains, pages 188-207, 1999.
28. U. Herzog. Formal description, time and performance analysis: A framework. Technical Report 15/90, IMMD VII, Friedrich-Alexander- Universität, Erlangen-Nürnberg, Germany, Sept. 1990.
29. U. Herzog and V. Mertsiotakis. Stochastic Process Algebras Applied to Failure Modelling. In U. Herzog and M. Rettelbach, editors, Proc. of 2nd Process Algebra and Performance Modelling Workshop, 1994.
30. J. Hillston. The nature of synchronisation. In U. Herzog and M. Rettelbach, editors, Proc. of 2nd Int. Workshop on Process Algebras and Performance Modelling, pages 51-70, Erlangen, 1994.
31. J. Hillston. Compositional Markovian modelling using a process algebra. In W. Stewart, editor, Proc. of 2nd Int. Workshop on Numerical Solution of Markov Chains: Computations with Markov Chains, Raleigh, North Carolina, Jan. 1995. Kluwer Academic Press.
32. J. Hillston. A Compositional Approach to Performance Modelling. Cambridge University Press, 1996.
33. J. Hillston. FMPA Lecture Notes, chapter Exploiting Structure in Solution: Decomposing Composed Models. Springer-Verlag, 2001.
34. J. Hillston and L. Kloul. An efficient Kronecker representation for PEPA models. In L. de Alfaro and S. Gilmore, editors, Proc. of 1st PAPM-PROBMIV Workshop, volume 2165 of LNCS, pages 120-135, Aachen, Germany, Sept. 2001. Springer-Verlag.
35. J. Hillston and N. Thomas. A syntactical analysis of reversible PEPA models. In C. Priami, editor, Proc. of 6th Workshop on Process Algebra and Performance Modelling, pages 37-49, Nice, France, Sept. 1998.
36. J. Hillston and N. Thomas. Product form solution for a class of PEPA models. Performance Evaluation, 35(3-4):171-192, 1999.
37. D. Holton. A PEPA specification of an industrial production cell. The Computer Journal, 38(7):542-551, 1995.
38. I.S.O. LOTOS: A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour. IS 8807, TC97/SC21, 1989.
39. J. Jackson. Jobshop-like Queueing Systems. Management Science, 10:131-142, 1963.
40. F. Kelly. Reversibility and Stochastic Processes. Wiley, 1979.
41. J. Kemeny and J. Snell. Finite Markov Chains. Van Nostrand, 1960.
42. L. Kleinrock. Queueing Systems, Volume I: Theory. John Wiley, New York, 1975.
43. M. Kwiatkowska. Model checking for probability and time: From theory to practice. In Proc. 18th IEEE Symposium on Logic in Computer Science (LICS'03), pages 351-360. IEEE Computer Society Press, 2003.
44. M. Kwiatkowska, G. Norman, and D. Parker. PRISM: Probabilistic symbolic model checker. In Proc. of 12th Int. Conf. on Modelling Tools and Techniques for Computer and Communication System Performance Evaluation, number 2324 in LNCS, pages 200-204, London, UK, Apr. 2002. Springer-Verlag.
45. K. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):1-28, 1991.
46. F. N. M. Buchholtz, H. Riis Nielson. A calculus for control flow analysis of security protocols. International Journal of Information Security, 2(3-4):145-167, 2004.
47. M. A. Marsan, G. Balbo, G. Conte, S. Donatelli, and G. Franceschinis. Modelling with Generalized Stochastic Petri Nets. Wiley, 1995.
48. B. Mitchell and J. Hillston. Analysing web service composition with PEPA. In Proc. of 3rd Workshop on Process Algebras and Stochastically Timed Activities, pages 33-44, Edinburgh, Scotland, June 2004.
49. C. Priami. Stochastic π-Calculus. The Computer Journal, 38(6), 1995.
50. B. Strulo and P. Harrison. Spades - a process algebra for discrete event simulation. J. Logic Computat, 10(1):3-42, 2000.