Testing Equivalences and Fully Abstract Models for Probabilistic Processes

   page       BibTeX_logo.png   
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

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.