Ivan Christoff

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.

CONCUR '90 Theories of Concurrency: Unification and Extension, Lecture Notes in Computer Science 458, pages 126-138, .
J.C.M. Baeten, J.W. Klop (eds.), Springer Berlin Heidelberg
@incollection{christoff-concur1990,
Author = {Christoff, Ivan},
Booktitle = {CONCUR '90 Theories of Concurrency: Unification and Extension},
Doi = {10.1007/BFb0039056},
Editor = {Baeten, J.C.M. and Klop, J.W.},
Isbn = {978-3-540-53048-0},
Pages = {126--138},
Publisher = {Springer Berlin Heidelberg},
Series = {LNCS,
Title = {Testing Equivalences and Fully Abstract Models for Probabilistic Processes},
Url = {http://link.springer.com/chapter/10.1007/BFb0039056},
Volume = 458,
Year = 1990}

Tags:
    

Publication

Testing Equivalences and Fully Abstract Models for Probabilistic Processes

— status

published  

— authors

Ivan Christoff

— editors

J.C.M. Baeten, J.W. Klop

URLs & IDs

original page

— DOI

10.1007/BFb0039056

— print ISBN

978-3-540-53048-0

BibTeX

— BibTeX ID
christoff-concur1990
— BibTeX category
incollection

Partita IVA: 01131710376 - Copyright © 2008-2021 APICe@DISI Research Group - PRIVACY