Abstract
We present a testing preorder for probabilistic processes based on the natural notion of a process passing a test with a certain probability. The theory enjoys close connections with the classical testing theory of Hennessy and DeNicola in that whenever a process passes a test with probability 1 (respectively some non-0 probability) in our setting, then the process must (respectively may) pass the test in the classical theory. In addition, we develop an alternative characterisation of the probabilistic testing preorder that is based on the “must sets” characterization of De Nicola. Finally, we extend our theory of testing to substochastic processes, in which the sum of the probabilities of a process's outgoing transitions may be strictly less than 1, with the deficit representing the process' capacity for undefined behavior. A simple example involving the construction of pipelines from faulty buffer cells is given to illustrate how substochastic processes, and the resulting preorder, can be used to model fault-tolerant systems and to reason about system reliability.
Preview
Unable to display preview. Download preview PDF.
References
B. Bloom and A. R. Meyer. A remark on bisimulation between probabilistic processes. In Meyer and Tsailin, editors, Logik at Botik, Springer-Verlag, 1989.
I. Christoff. Testing Equivalences for Probabilistic Processes. Technical Report DoCS 90/22, Ph.D. Thesis, Department of Computer Science, Uppsala University, Uppsala, Sweden, 1990.
R. Cleaveland and A. Zwarico. A theory of testing for real-time. In Proceedings of the Sixth IEEE Symposium on Logic in Computer Science, July 1991.
R. De Nicola. Extensional equivalences for transition systems. Acta Informatica, 24:211–237, 1987.
R. De Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83–133, 1983.
M. C. B. Hennessy. Algebraic Theory of Processes. MIT Press, Boston, Mass., 1988.
C.-C. Jou and S. A. Smolka. Equivalences, congruences, and complete axiomatizations for probabilistic processes. In J. C. M. Baeten and J. W. Klop, editors, Proceedings of CONCUR '90, pages 367–383, Springer-Verlag, Berlin, 1990.
K. G. Larsen and A. Skou. Bisimulation through probabilistic testing. In Proceedings of 16th Annual ACM Symposium on Principles of Programming Languages, 1989.
R. Milner. A Calculus of Communicating Systems. Volume 92 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1980.
R. Milner. Communication and Concurrency. International Series in Computer Science, Prentice Hall, 1989.
R. J. van Glabbeek, S. A. Smolka, B. Steffen, and C. M. N. Tofts. Reactive, generative, and stratified models of probabilistic processes. In Proceedings of the 5th IEEE Symposium on Logic in Computer Science, pages 130–141, Philadelphia, PA, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cleaveland, R., Smolka, S.A., Zwarico, A. (1992). Testing preorders for probabilistic processes. In: Kuich, W. (eds) Automata, Languages and Programming. ICALP 1992. Lecture Notes in Computer Science, vol 623. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55719-9_116
Download citation
DOI: https://doi.org/10.1007/3-540-55719-9_116
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55719-7
Online ISBN: 978-3-540-47278-0
eBook Packages: Springer Book Archive