Exact performance equivalence: An equivalence relation for stochastic automata

Theoretical Computer Science

Volumn 215, Issue 1-2, 1999, Pages 263-287

  Buchholz, Peter ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Equivalence of stochastic automata; Qualitative analysis; Quantitative analysis; Stochastic automata

Indexed keywords

EID: 0002549537     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00169-8     Document Type: Article

References (22)

1. S. Aggarwal, R.P. Kurshan, K.A. Sabnami, A calculus for protocol specification and validation, in: H. Rudin, C.H. West (Eds.), Protocol Specification, Testing and Verification III, North Holland, Amsterdam, 1983, 19-34.
2. S.D. Brookes, C.A. Hoare, A.W. Roscoe, A theory of communicating sequential processes; J. ACM 31 (1984) 560-599.
3. P. Buchholz, Exact and ordinary lumpability in finite Markov chains, J. Appl. Probab. 31 (1994) 59-75.
4. P. Buchholz, Markovian process algebra: composition and equivalence, in: U. Herzog, M. Rettelbach (Eds.), Proc. 2nd Worksh. on Process Algebras and Performance Modelling; Arbeitsberichte des IMMD, vol. 27, No. 4, 1994, pp. 11-30.
5. P. Buchholz, Equivalence relations for stochastic automata networks, in: W.J. Stewart (Ed.), Computation with Markov Chains: Proc. 2nd Internat. Worksh. on the Num. Sol. of Markov Chains, Kluwer, Dordrecht, 1995, pp. 197-216.
6. P. Buchholz, A notion of equivalence for stochastic Petri nets, in: G. De Michelis, M. Diaz (Eds.), Application and Theory of Petri Nets, 1995, Lecture Notes in Computer Science, Vol. 935, Springer, Berlin, 1995, pp. 161-180.
7. P. Buchholz, Efficient computation of equivalent and reduced representations for stochastic automata, Internat. J. Comput Systems Sci. Eng., to appear
8. N. Götz, U. Herzog, M. Rettelbach, Multiprocessor and distributed system design: The integration of functional specification and performance analysis using stochastic process algebras, in: L. Donatiello, R. Nelson (Eds.), Performance 93, Lecture Notes in Computer Science, Vol. 729, Springer, Berlin, 1993, pp. 121-146.
9. J. Hillston, A compositional approach for performance modelling, Ph.D. Thesis, Dep. of Comp. Sci., University of Edinburgh, 1994.
10. J. Hillston, Compositional Markovian modelling using a process algebra, in: W.J. Stewart (Ed.), Computation with Markov Chains: Proc. 2nd Internat. Workshop on the Num. Sol. of Markov Chains, Kluwer, Dordrecht, 1995, pp. 177-196.
11. J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 1979.
12. R.A. Howard, Dynamic Probabilistic Systems, vol. II: Semi-Markov and Decision Processes, Wiley, New York, 1971.
13. P.C. Kanellakis, S.A. Smolka, CCS expressions, finite state processes and three problems of equivalence, Inform. Comput. 86 (1990) 43-68.
14. M.T. Liu, Protocol engineering, Adv. Comput. 29 (1989) 79-195.
15. R. Milner, Communication and Concurrency, Prentice-Hall, Englewood Cliffs, NJ, 1989.
16. R. De Nicola, M.C. Hennessy, Testing equivalence for processes, Theoret. Comput. Sci. 34 (1984) 83-133.
17. X. Nicollin, J. Sifakis, An overview and synthesis on timed process algebras, in: J.W. de Bakker, C. Huizing, W.P. de Roever, G. Rozenberg (Eds.), Real Time: Theory in Practice, Lecture Notes in Computer Science, Vol. 600, Springer, Berlin, 1991, pp. 526-548.
18. B. Plateau, On the stochastic structure of parallelism and synchronisation models for distributed algorithms, Performance Evaluation Review 13 (1985) 147-154.
19. B. Plateau, K. Atif, Stochastic automata networks for modeling parallel systems, IEEE Trans. Software Eng. 17 (1991) 1093-1108.
20. B. Plateau, J.M. Fourneau, A methodology for solving Markov models of parallel systems, J Parallel Distr. Comp. 12 (1991) 370-387.
21. W.J. Stewart, Introduction to the numerical Solution of Markov Chains, Princeton University Press, Primeton, 1994.
22. K.S. Trivedi, J.K. Muppala, S.P. Woolet, B.R. Haverkort, Composite performance and dependability analysis, Performance Evaluation 14 (1992) 197-215.