Turning back time in Markovian process algebra

Theoretical Computer Science

Volumn 290, Issue 3, 2003, Pages 1947-1986

  Harrison, Peter G ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

MARKOV PROCESSES;

COMPOSITIONALITY; JACKSON'S THEOREMS; MARKOVIAN PROCESS ALGEBRAS; NEW RESULTS; PRODUCT FORMS; PRODUCT-FORM SOLUTIONS; STATE PROBABILITY; STATIONARY MARKOV PROCESS;

ALGEBRA;

EID: 85009174863     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00375-4     Document Type: Article

References (20)

1. [1] V.V. Anisimov, Asymptotic aggregation of states for finite Markov processes, unpublished private communication, 2001.
2. [2] Bernardo, M., Gorrieri, R., A tutorial on EMPA: a theory of concurrent processes with nondeterminism, priorities, probabilities and time. Theoret. Comput. Sci. 202 (1998), 1–54.
3. [3] Burke, P.J., The output of a queueing system. Oper. Res. 4 (1956), 699–704.
4. [4] G. Clark, J. Hillston, Product form solution for an insensitive stochastic process algebra structure, Performance Evaluat. (2002) to appear.
5. [5] Gelenbe, E., Random neural networks with positive and negative signals and product form solution. Neural Comput. 1:4 (1989), 502–510.
6. [6] Gelenbe, E., Queueing networks with negative and positive customers. J. Appl. Probab. 28 (1991), 656–663.
7. [7] Goetz, N., Herzog, U., Rettelbach, M., Multiprocessor and distributed system design: the integration of functional specification and performance analysis using stochastic process algebras. Proc. PERFORMANCE ’93, Rome, Lecture Notes in Computer Science, Vol. 229, 1993, Springer, Berlin, 121–146.
8. [8] Harrison, P.G., Hillston, J., Exploiting quasi-reversible structures in Markovian process algebra models. Comput. J. 38:7 (1995), 510–520.
9. [9] Harrison, P.G., Patel, N.M., Performance Modelling of Communication Networks and Computer Architectures, 1992, Addison-Wesley, Reading, MA.
10. [10] Harrison, P.G., Strulo, B., Spades–a process algebra for discrete event simulation. J. Logic Comput. 10:1 (2000), 3–42.
11. [11] J. Hillston, A compositional approach to performance modelling, Ph.D. Thesis, University of Edinburgh, 1994.
12. [12] Hillston, J., Thomas, N., Product form solution for a class of PEPA models. Performance Evaluat. 35:3–4 (1999), 171–192.
13. [13] Jackson, J.R., Jobshop-like queueing systems. Manag. Sci. 10:1 (1963), 131–142.
14. [14] Katoen, J.P., Markovian bisimulation. Sci. Comput. Programming 202 (2000), 1–54.
15. [15] J.P. Katoen P. D'Argenio, E. Brinksma, General purpose discrete event simulation using ♠, in: Proc. PAPM 1998, Nice, July 1998, pp. 85–102.
16. [16] Kelly, F.P., Reversibility and Stochastic Networks, 1979, Wiley, New York.
17. [17] Knottenbelt, W., Harrison, P., Mestern, M., Kritzinger, P., A probabilistic dynamic technique for the distributed generation of very large state spaces. Performance Evaluat. J. 39:1–4 (2000), 127–148.
18. [18] W. Knottenbelt, P. Harrison. Distributed disk-based solution techniques for large Markov models, in: Proc. 3rd Internat. Conf. Numerical Solution of Markov Chains, NSMC ’99, Zaragoza, September 1999, pp. 58–75.
19. [19] Plateau, B., Stewart, W., Kronecker algebra. J. Assoc. Comput. Mach., 45(2), 1998.
20. [20] Sereno, M., Towards a product form solution for stochastic process algebras. Comput. J. 38:7 (1995), 622–632.