Probabilistic communicating processes
type: Item
instance of: scholarly article
title: Probabilistic communicating processes
zbMATH Open document ID: 0872.68111
DOI: 10.1016/0304-3975(94)00286-0
author: Karen Seidel
published in: Theoretical Computer Science
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 984873
zbMATH Keywords: communicating sequential processes (CSP)
zbMATH Keywords: correctness of probabilistic algorithms
zbMATH Keywords: probability measures on the space of infinite traces
zbMATH Keywords: conditional probability measures of infinite traces
zbMATH Keywords: proof rules for the deterministic properties of probabilistic algorithms
zbMATH Keywords: self-stabilising tokenring
zbMATH Keywords: specification of distributed systems
zbMATH Keywords: concurrency
describes a project that uses: UNITY
MaRDI profile type: Publication
full work available at URL: 0304-3975(94)00286-0
OpenAlex ID: W4212872794
cites work: Defining liveness
cites work: Q4197800
cites work: Q4692502
cites work: Recursion induction for real-time processes
cites work: Q3241504
cites work: Reactive, generative, and stratified models of probabilistic processes
cites work: Probabilistic self-stabilization
cites work: Q3777424
cites work: Q3203061
cites work: CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
cites work: Bisimulation through probabilistic testing
cites work: LOTOS extended with probabilistic behaviours
cites work: Q3992568
cites work: A lattice-theoretical fixpoint theorem and its applications
description: scientific article; zbMATH DE number 984873