Composition and behaviors of probabilistic I/O automata

Theoretical Computer Science

Volumn 176, Issue 1-2, 1997, Pages 1-38

  Wu, Sue Hwey ^a   Smolka, Scott A ^a   Stark, Eugene W ^a  

^a Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EQUIVALENCE CLASSES; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; PROBABILISTIC LOGICS;

PROBABILISTIC BEHAVIOR MAPS;

AUTOMATA THEORY;

EID: 0031125422     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00056-X     Document Type: Review

References (24)

1. I. Christoff, Testing equivalences and fully abstract models for probabilistic processes, in: J.C.M. Baeten and J.W. Klop, ed., Proc. CONCUR'90 - 1st Internat. Conf. on Concurrency Theory, Lecture Notes in Computer Science, Vol. 458 (Springer, Berlin, 1990) 126-140.
2. R. Cleaveland, S.A. Smolka and A.E. Zwarico, Testing preorders for probabilistic processes, in: Proc. 19th ICALP, July 1992.
3. R. de Nicola and M.C.B. Hennessy, Testing equivalence for processes, Theoret. Comput. Sci. 34 (1983) 83-133.
4. N. Götz, U. Herzog and M. Rettlebach, TIPP - a language for timed processes and performance evaluation, Technical Report 4/92, University of Erlangen-Nürnberg, Germany, November 1992.
5. H.A. Hansson, Time and probability in formal design of distributed systems, Ph.D. Thesis, Department of Computer Systems, Uppsala University, 1991.
6. H.A. Hansson and B. Jonsson, A calculus for communicating systems with time and probabilities, in: Proc. 11th IEEE Symp. on Real-Time Systems, 1990.
7. M.C.B. Hennessy, Algebraic Theory of Processes (MIT Press, Boston, MA, 1988).
8. J. Hillston, PEPA: performance enhanced process algebra, Technical Report CSR-24-93, Department of Computer Science, University of Edinburgh, Edinburgh, Great Britain, March 1993.
9. B. Jonsson and K.G. Larsen, Specification and refinement of probabilistic processes, in: Proc. 6th IEEE Symp. on Logic in Computer Science, Amsterdam, July 1991.
10. S. Lang, Undergraduate Algebra (Springer, New York, 1990).
11. K.G. Larsen and A. Skou, Bisimulation through probabilistic testing, Inform. and Comput. 94 (1992) 1-28; Preliminary versions of this paper appeared as University of Aalborg Technical Reports R 88-18 and R88-29, and in Proc. 16th Ann. ACM Symp. on Principles of Programming Languages, Austin, Texas, 1989.
12. K.G. Larsen and A. Skou, Bisimulation through probabilistic testing, Inform. and Comput. 94 (1992) 1-28; Preliminary versions of this paper appeared as University of Aalborg Technical Reports R 88-18 and R88-29, and in Proc. 16th Ann. ACM Symp. on Principles of Programming Languages, Austin, Texas, 1989.
13. N.A. Lynch and M. Tuttle, Hierarchical correctness proofs for distributed algorithms, in: Proc. 6th Ann. ACM Symp. on Principles of Distributed Computing, 1987.
14. N.A. Lynch and F.W. Vaandrager, Forward and backward simulations for timing-based systems, in: Proc. REX Workshop "Real-Time: Theory in Practice", Lecture Notes in Computer Science, Vol. 600 (Springer, Berlin, 1991) 397-446.
15. R. Milner, Communication and Concurrency (Prentic-Hall, Englewood Cliffs, NJ, 1989).
16. M.K. Molloy, Performance analysis using stochastic Petri nets, IEEE Trans. Comput. C-31 (1982).
17. M.O. Rabin, Probabilistic automata, Inform. and Control 6 (1963) 230-245.
18. K. Seidel, Probabilistic CSP, Ph.D. Thesis, Technical Monograph PRG-102, Programming Research Group, Oxford University Computing Laboratory, 1992.
19. R. Segala and N. Lynch, Probabilistic simulations for probabilistic processes, in: B. Jonsson and J. Parrow, eds., Proc. CONCUR'94 - 5th Internat. Conf. on Concurrency Theory, Lecture Notes in Computer Science, Vol. 836 (Springer, Berlin, 1994) 481-496.
20. K.S. Trivedi, Probability and Statistics with Reliability, Queuing, and Computer Science Applications (Prentice-Hall, Englewood Cliffs, NJ, 1982).
21. M. Tuttle, Hierarchical correctness proofs for distributed algorithms, Master's Thesis, MIT, April 1987.
22. R.J. van Glabbeek, S.A. Smolka, B. Steffen and C.M.N. Tofts, Reactive, generative, and stratified models of probabilistic processes, in: Proc. 5th IEEE Symp. on Logic in Computer Science, Philadelphia, PA (1990) 130-141; extended version to appear in Inform. and Comput.
23. A.J. Weir, General Integration and Measure (Cambridge University Press, Cambridge, 1974).
24. S. Yuen, R. Cleaveland, Z. Dayar and S.A. Smolka, Fully abstract characterizations of testing preorders for probabilistic processes, in: B. Jonsson and J. Parrow, eds., Proc. CONCUR'94 - 5th Internat. Conf. on Concurrency Theory, Lecture Notes in Computer Science, Vol. 836 (Springer, Berlin, 1994) 497-512.