Abstract
We study testing preorders for probabilistic automata and we characterize them in terms of relations that are based on inclusion of trace and failure distributions, i.e., probability distributions over failures and traces that can arise in a probabilistic computation. The novelty of our approach to testing is the use of multiple success actions rather than a single action. This allows us to observe the relative probabilities of different traces within a computation.
We define and characterize two kinds of testing preorders: preorders sensitive to infinite traces, and preorders sensitive to finite traces only. The second kind of preorder is an extension to the probabilistic framework of the testing preorders of De Nicola and Hennessy. We show that under assumptions of finite branching and strong convergence the two kinds of preorders coincide.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Aggarwal. Time optimal self-stabilizing spanning tree algorithms. Technical Report MIT/LCS/TR-632, MIT Laboratory for Computer Science, 1994. Master's thesis.
S.D. Brookes, C.A.R. Hoare, and A.W. Roscoe. A theory of communicating sequential processes. Journal of the ACM, 31(3):560–599, 1984.
R. De Nicola and M. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83–133, 1984.
H. Hansson. Time and Probability in Formal Design of Distributed Systems, volume 1 of Real-Time Safety Critical Systems. Elsevier, 1994.
M. Hennessy. Algebraic Theory of Processes. MIT Press, Cambridge, MA, 1988.
C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall International, Englewood Cliffs, 1985.
B. Jonsson, C. Ho-Stuart, and W. Yi. Testing and refinement for nondeterministic and probabilistic processes. In Proceedings of the Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS 863, pages 418–430, 1994.
B. Jonsson and W. Yi. Compositional testing preorders for probabilistic processes. In Proceedings 10 th Annual Symposium on Logic in Computer Science, San Diego, California. IEEE Computer Society Press, 1995.
N.A. Lynch, I. Saias, and R. Segala. Proving time bounds for randomized distributed algorithms. In Proceedings of the 13 th Annual ACM Symposium on Principles of Distributed Computing, Los Angeles, CA, pages 314–23, 1994.
G.D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer science Department, Aarhus University, 1981.
A. Pogosyants and R. Segala. Formal verification of timed properties of randomized distributed algorithms. In Proceedings of the 14 th Annual ACM Symposium on Principles of Distributed Computing, Ottawa, Ontario, Canada, pages 174–283, August 1995.
R. Segala. A compositional trace-based semantics for probabilistic automata. In Proceedings of CONCUR 95, Philadelphia, PA, USA, LNCS 962, pages 234–248, 1995.
R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, Dept. of Electrical Engineering and Computer Science, 1995.
R. Segala and N.A. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250–273, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Segala, R. (1996). Testing probabilistic automata. In: Montanari, U., Sassone, V. (eds) CONCUR '96: Concurrency Theory. CONCUR 1996. Lecture Notes in Computer Science, vol 1119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61604-7_62
Download citation
DOI: https://doi.org/10.1007/3-540-61604-7_62
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61604-7
Online ISBN: 978-3-540-70625-0
eBook Packages: Springer Book Archive