Abstract
We present a framework in which the observable behavior of probabilistic processes is distinguished through testing. Probabilistic transition systems are used to model the operational behavior of processes. The observable behavior of processes is studied in terms of probabilities for successful interaction with tests. Based on these probabilities three equivalences are defined. We define three denotational models, and show that each model contains exactly the necessary information for verification of one of the equivalences.
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. Abramsky. Observation equivalence as a testing equivalence. Theor. Comp. Sci.53, pp 225–241, 1987.
N. Akinaga, Decision Procedures for Relations on Probabilistic Transition Systems. MSc thesis, Department of Computer Systems, Uppsala University, Uppsala, Sweden, 1989. Available as report DoCS 89/19.
J.A. Bergstra, J.W. Klop. Process algebra for synchronous communication. Information and Control60, pp 109–137, 1984.
G. Berry, P.-L. Curien, J.-J. Lévy. Full abstraction for sequential languages: the state of the art. Algebraic Methods in Semantics, eds. M. Nivat and J.C. Reynolds, Cambridge University Press, pp 89–132, 1985.
I. Christoff. Distinguishing probabilistic processes through testing. Manuscript presented at Nordic Workshop on Program Correctness, Uppsala, Sweden, 1989.
I. Christoff. Testing Equivalences for Probabilistic Processes. PhD thesis, Department of Computer Systems, Uppsala University, Uppsala, Sweden, 1990. In preparation.
R. De Nicola, M. Hennessy. Testing equivalences for processes. Theor. Comp. Sci.34, pp 83–133, 1984.
A. Giacalone, C.-C. Jou, S.A. Smolka. Algebraic reasoning for probabilistic concurrent systems. Proc. Working Conf. on Programming Concepts and Methods (IFIP TC2), Sea of Galilee, Israel, 1990.
R.v. Glabbeek, S.A. Smolka, B. Steffen, C. Tofts. Reactive, generative, and stratified models of probabilistic processes. Proc. 5th IEEE Symp. on Logic in Computer Science, Philadelphia, Pennsylvania, 1990.
M. Hennessy. Algebraic Theory of Processes, MIT Press, 1988.
M. Hennessy, G. Plotkin. Full abstraction for a simple parallel programming language. Proc. 8th Symp. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science74, pp 108–120, 1979.
C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
B. Jonsson. A fully abstract trace model for dataflow networks. Proc. 16th ACM Symp. on Principles of Programming Languages, pp 155–165, 1989.
K.G. Larsen, A. Skou. Bisimulation through probabilistic testing. Proc. 16th ACM Symp. on Principles of Programming Languages, pp 344–352, 1989.
R. Milner. A Calculus of Communicating Systems. Lecture Notes in Computer Science92, 1980.
I. Phillips. Refusal testing. Theor. Comp. Sci.50, pp 241–284, 1987.
G. Plotkin. A Structural Approach to Operational Semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, Aarhus, Denmark, 1981.
A. Pnueli. Linear and branching structures in the semantics and logics of reactive systems. Proc. 12th Intl. Coll. on Automata, Languages and Programming, Lecture Notes in Computer Science194, pp 15–32, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Christoff, I. (1990). Testing equivalences and fully abstract models for probabilistic processes. In: Baeten, J.C.M., Klop, J.W. (eds) CONCUR '90 Theories of Concurrency: Unification and Extension. CONCUR 1990. Lecture Notes in Computer Science, vol 458. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039056
Download citation
DOI: https://doi.org/10.1007/BFb0039056
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53048-0
Online ISBN: 978-3-540-46395-5
eBook Packages: Springer Book Archive