Results 1  10
of
91
Bisimulation through probabilistic testing
 in “Conference Record of the 16th ACM Symposium on Principles of Programming Languages (POPL
, 1989
"... We propose a language for testing concurrent processes and examine its strength in terms of the processes that are distinguished by a test. By using probabilistic transition systems as the underlying semantic model, we show how a testing algorithm can distinguish, with a probability arbitrarily clos ..."
Abstract

Cited by 529 (14 self)
 Add to MetaCart
is shown to identify a new process relation called probabilistic bisimulationwhich is strictly stronger than bisimulation. li? 1991 Academic Press. Inc. 1.
Priority as Extremal Probability
, 1992
"... We extend the stratified model of probabilistic processes presented in [vGSST90] to obtain a very general notion of process priority . The main idea is to allow probability guards of value 0 to be associated with alternatives of a probabilistic summation expression. Such alternatives can be chosen o ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
semantics and a notion of probabilistic bisimulation, which is shown to be a congruence. Of particular interest is the abstraction PCCS ß of PCCS i in which all nonzero probability guards are identified. Both the operational and bisimulation semantics of PCCS i easily adapt to this abstraction. PCCS ß
Algebraic Reasoning for Probabilistic Concurrent Systems
 Proc. IFIP TC2 Working Conference on Programming Concepts and Methods
, 1990
"... We extend Milner's SCCS to obtain a calculus, PCCS, for reasoning about communicating probabilistic processes. In particular, the nondeterministic process summation operator of SCCS is replaced with a probabilistic one, in which the probability of behaving like a particular summand is given exp ..."
Abstract

Cited by 115 (6 self)
 Add to MetaCart
. We provide the first axiomatization of probabilistic bisimulation, a subset of which is relatively complete for finitestate probabilistic processes. In the probabilistic case, a notion of processes with almost identical behavior (i.e., with probability 1 \Gamma ffl, for ffl sufficiently small
Weak bisimulation for probabilistic systems
 CONCURRENCY THEORY, LNCS
, 2000
"... In this paper, we introduce weak bisimulation in the framework of Labeled Concurrent Markov Chains, that is, probabilistic transition systems which exhibit both probabilistic and nondeterministic behavior. By resolving the nondeterminism present, these models can be decomposed into a possibly infini ..."
Abstract

Cited by 59 (8 self)
 Add to MetaCart
In this paper, we introduce weak bisimulation in the framework of Labeled Concurrent Markov Chains, that is, probabilistic transition systems which exhibit both probabilistic and nondeterministic behavior. By resolving the nondeterminism present, these models can be decomposed into a possibly
Symbolic Bisimulations for Probabilistic Systems
"... The paper introduces symbolic bisimulations for a simple probabilistic πcalculus to overcome the infinite branching problem that still exists in checking ground bisimulations between probabilistic systems. Especially the definition of weak (symbolic) bisimulation does not rely on the random capabil ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
The paper introduces symbolic bisimulations for a simple probabilistic πcalculus to overcome the infinite branching problem that still exists in checking ground bisimulations between probabilistic systems. Especially the definition of weak (symbolic) bisimulation does not rely on the random
The Metric Analogue of Weak Bisimulation for Probabilistic Processes
, 2002
"... We observe that equivalence is not a robust concept in the presence of numerical information  such as probabilities  in the model. We develop a metric analogue of weak bisimulation in the spirit of our earlier work on metric analogues for strong bisimulation. We give a fixed point characterization ..."
Abstract

Cited by 68 (2 self)
 Add to MetaCart
We observe that equivalence is not a robust concept in the presence of numerical information  such as probabilities  in the model. We develop a metric analogue of weak bisimulation in the spirit of our earlier work on metric analogues for strong bisimulation. We give a fixed point
Equational axioms for probabilistic bisimilarity
 IN PROCEEDINGS OF 9TH AMAST, LECTURE NOTES IN COMPUTER SCIENCE
, 2002
"... This paper gives an equational axiomatization of probabilistic bisimulation equivalence for a class of finitestate agents previously studied by Stark and Smolka ((2000) Proof, Language, and Interaction: Essays in Honour of Robin Milner, pp. 571595). The axiomatization is obtained by extending ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
This paper gives an equational axiomatization of probabilistic bisimulation equivalence for a class of finitestate agents previously studied by Stark and Smolka ((2000) Proof, Language, and Interaction: Essays in Honour of Robin Milner, pp. 571595). The axiomatization is obtained by extending
On Quantitative Analysis of Probabilistic Protocols
, 2004
"... We advocate the use of approximate noninterference for the security analysis of probabilistic protocols. Our approach relies on a formalisation of the protocol in the setting of a probabilistic process algebra and a notion of process similarity based on weak probabilistic bisimulation. We illustrate ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We advocate the use of approximate noninterference for the security analysis of probabilistic protocols. Our approach relies on a formalisation of the protocol in the setting of a probabilistic process algebra and a notion of process similarity based on weak probabilistic bisimulation. We
Probabilistic Bisimulations of Switching and Resetting Diffusions Alessandro Abate
"... Abstract — This contribution presents sufficient conditions for the existence of probabilistic bisimulations between two diffusion processes that are additionally endowed with switching and resetting behaviors. A probabilistic bisimulation between two stochastic processes is defined by means of a bi ..."
Abstract
 Add to MetaCart
Abstract — This contribution presents sufficient conditions for the existence of probabilistic bisimulations between two diffusion processes that are additionally endowed with switching and resetting behaviors. A probabilistic bisimulation between two stochastic processes is defined by means of a
A Probabilistic Applied Pi–Calculus
, 2007
"... We propose an extension of the Applied Pi–calculus by introducing nondeterministic and probabilistic choice operators. The semantics of the resulting model, in which probability and nondeterminism are combined, is given by Segala’s Probabilistic Automata driven by schedulers which resolve the nonde ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
bisimulation which is shown to coincide with the observational equivalence. Finally, we prove that results in the probabilistic framework are preserved in a purely nondeterministic setting.
Results 1  10
of
91