Compositional reversed Markov processes, with applications to G-networks

Performance Evaluation

Volumn 57, Issue 3, 2004, Pages 379-408

  Harrison, P G ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

G networks; Markov processes; Process Algebra; Product forms

Indexed keywords

ALGEBRA; COMPUTER APPLICATIONS; MARKOV PROCESSES; PROBABILITY DISTRIBUTIONS; SYNCHRONIZATION; SYNTACTICS; THEOREM PROVING;

EQUILIBRIUM SOLUTIONS; G-NETWORKS; PROCESS ALGEBRA; PRODUCT-FORMS;

TELECOMMUNICATION NETWORKS;

EID: 2942536773     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.peva.2004.02.002     Document Type: Article

References (19)

1. Baskett F., Chandy K.M., Muntz R.R., Palacios F.G., Open, closed and mixed networks of queues with different classes of customers. J. ACM. 22(2):1975;248-260.
2. Boucherie R.J., A characterisation of independence for competing Markov chains with applications to stochastic Petri nets. IEEE Trans. Software Eng. 20(7):1994;536-544.
3. X. Chao, M. Miyazawa, M. Pinedo, Queueing Networks: Customers, Signals and Product Form Solutions, Wiley, New York, 1999.
4. Fourneau J.-M., Gelenbe E., Suros R., G-networks with multiple classes of positive and negative customers. Theor. Comput. Sci. 155:1996;141-156.
5. Gelenbe E., Random neural networks with positive and negative signals and product form solution. Neural Comput. 1(4):1989;502-510.
6. Gelenbe E., G-networks with triggered customer movement. J. Appl. Prob. 30:1993;742-748.
7. Gelenbe E., G-networks with signals and batch removal. Prob. Eng. Inform. Sci. 7:1993;335-342.
8. E. Gelenbe, J.-M. Fourneau, G-networks with resets, in: Proceedings of the Performance'02, Rome, Perform. Eval. 49 (2002) 179-191.
9. Gelenbe E., Labed A., G-networks with multiple classes of signals and positive customers. Euro. J. Oper. Res. 108(2):1998;293-305.
10. Gelenbe E., Schassberger R., Stability of product form G-networks. Prob. Eng. Inform. Sci. 6:1992;271-276.
11. Harrison P.G., Turning back time in Markovian Process Algebra. Theor. Comput. Sci. 290:2003;1947-1986.
12. P.G. Harrison, Mechanical solution of G-networks via Markovian Process Algebra, in: Proceedings of the International Conference on Stochastic Modelling and the IV International Workshop on Retrial Queues, Notable Publications, Cochin, India, December 2002.
13. P.G. Harrison, Reversed processes, product forms, non-product forms and a new proof of the BCMP theorem, in: Proceedings of the Numerical Solutions of Markov Chains, University of Illinois at Urbana-Champaign, September 2003.
14. P.G. Harrison, N.M. Patel, Performance Modelling of Communication Networks and Computer Architectures, Addison-Wesley, Wokingham, UK, 1993.
15. J. Hillston, A compositional approach to performance modelling, Ph.D. Thesis, University of Edinburgh, 1994.
16. J. Hillston, N. Thomas, A syntactic analysis of reversible PEPA models, in: Proceedings of the PAPM, Nice, July 1998.
17. Hillston J., Thomas N., Product form solution for a class of PEPA models. Perform. Eval. 35:1999;171-192.
18. J.R. Jackson, Jobshop-like queueing systems, Manage. Sci. 10 (1) (1963) 131-142.
19. F.P. Kelly, Reversibility and Stochastic Networks, Wiley, Chichester, 1979.