Enter a brief description of your changes
(Required)
Minor changes are by default collapsed in the page history.
No changes
The page does not exist yet.
Failed to load changes
Version by on
Leave Collaboration
Are you sure you want to leave the realtime collaboration and continue editing alone? The changes you save while editing alone will lead to merge conflicts with the changes auto-saved by the realtime editing session.
Testing Equivalences and Fully Abstract Models for Probabilistic Processes
Ivan Christoff
J.C.M. Baeten, J.W. Klop (eds.)
CONCUR '90 Theories of Concurrency: Unification and Extension, pages 126–138
Lecture Notes in Computer Science 458
Springer Berlin Heidelberg
1990
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.
