Testing Preorders for Probabilistic Processes

Information and Computation

Volumn 154, Issue 2, 1999, Pages 93-148

  Cleaveland, Rance ^a   Dayar, Zeynep ^b   Smolka, Scott A ^a   Yuen, Shoji ^c  

^a Stony Brook University   (United States)

^b North Carolina State University   (United States)

^c NAGOYA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012415707     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1999.2808     Document Type: Article

References (20)

1. Baier, C., and Hermanns, H. (1997), Weak bisimulation for fully probabilistic processes, in "Computer Aided Verification (CAV '97), Haifa, Israel" (O. Grunberg, Ed.), Lecture Notes in Computer Science, Vol. 1254, pp. 119-130, Springer-Verlag, Berlin.
2. Christoff, I. (1990), "Testing Equivalences for Probabilistic Processes," Technical Report DoCS 90/22, Ph.D. thesis, Department of Computer Science, Uppsala University, Uppsala.
3. Cleaveland, R., Smolka, S. A., and Zwarico, A. E. (1992), Testing preorders for probabilistic processes, in "Automata, Languages, and Programming (ICALP '92), Vienna" (W. Kuich, Ed.), Lecture Notes in Computer Science, Vol. 623, pp. 708-719, Springer-Verlag, Berlin.
4. Cleaveland, R., and Zwarico, A. (1991), A theory of testing for real time, in "Sixth Annual Symposium on Logic in Computer Science (LICS '91), Amsterdam," pp. 110-119, Comput. Soc. Press, New York.
5. De Nicola, R., and Hennessy, M. C.B. (1983), Testing equivalences for processes, Theoret. Comput. Sci. 34, 83-133.
6. van Glabbeek, R. J., Smolka, S. A., and Steffen, B. (August 1995), Reactive, generative, and stratified models of probabilistic processes, Inform. and Comput. 121, 59-80.
7. Hennessy, M. C. B. (1988), "Algebraic Theory of Processes," MIT Press, Cambridge, MA.
8. Hansson, H. A., and Jonsson, B. (1990), A calculus for communicating systems with time and probabilities, in "Proceedings of the 11th IEEE Symposium on Real-Time Systems."
9. Jou, C.-C., and Smolka, S. A. (1990), Equivalences, congruences, and complete axiomatizations for probabilistic processes, in "Proceedings of the First International Conference on Concurrency Theory (CONCUR '90) Berlin" (J. C. M. Baeten and J. W. Klop, Eds.), Lecture Notes in Computer Science, Vol. 458, pp. 367-383, Springer-Verlag, Berlin.
10. Jonsson, B., and Yi, W. (1995), Compositional testing preorders for probabilistic processes, in "Tenth Annual Symposium on Logic in Computer Science (LICS '95), San Diego," pp. 431-441, Comput. Soc. Press, New York.
11. Narayan Kumar, K., Cleaveland, R., and Smolka, S. A. (1998), Infinite probabilistic and non-probabilistic testing, in "Proceedings of the 18th Conference on the Foundations of Software Technology and Theoretical Computer Science," Lecture Notes in Computer Science, Springer-Verlag, Berlin.
12. Larsen, K. G., and Skou, A. (1991), Bisimulation through probabilistic testing, Inform. and Comput. 94(1), 1-28.
13. Lynch, A., and Tuttle, M. (1987), Hierarchical correctness proofs for distributed algorithms, in "Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing," pp. 137-151.
14. Manna, Z., and Pnueli, A. (1991), "The Temporal Logic of Reactive and Concurrent Systems: Specification," Springer-Verlag, Berlin/New York.
15. Nunez, M., de Frutos, D., and Llana, L. (1995), Acceptance trees for probabilistic processes, in "Proceedings of CONCUR '95 - Sixth International Conference on Concurrency Theory" (I. Lee and S. A. Smolka, Eds.), Lecture Notes in Computer Science, Vol. 962, Springer-Verlag, Berlin.
16. Pnueli, A. (1986), Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends, in "Current Trends in Concurrency" (J. de Bakker, W.-P. de Roever, and G. Rozenberg, Eds.), Lecture Notes in Computer Science, Vol. 224, Springer-Verlag, Berlin.
17. Segala, R. (1986), Testing probabilistic automata, in "CONCUR '96, Pisa, Italy" (U. Montanari and V. Sassone, Eds.), Lecture Notes in Computer Science, Vol. 1119, pp. 299-314, Springer-Verlag, Berlin.
18. Wu, S.-H., Smolka, S. A., and Stark, E. W. (1997), Composition and behaviors of probabilistic I/O automata, Theoret. Comput. Sci. 176(1-2), 1-38.
19. Yuen, S., Cleaveland, R., Dayar, Z., and Smolka, S. A. (1994), Fully abstract characterizations of testing preorders for probabilistic processes, in "CONCUR '94, Upsala, Sweden" (B. Jonsson and J. Parrow, Eds.), Lecture Notes in Computer Science, Springer-Verlag, Berlin.
20. Yi, W., and Larsen, K. G. (1992), Testing probabilistic and nondeterministic processes, in "Protocol Specification, Testing and Verification XII," pp. 47-61, North-Holland, Amsterdam.