## Taking Chances on || and fail: Extending Strong and Probabilistic Bisimulation (1999)

Citations: | 2 - 1 self |

### BibTeX

@TECHREPORT{Hartog99takingchances,

author = {J. I. Den Hartog and E. P. De Vink},

title = {Taking Chances on || and fail: Extending Strong and Probabilistic Bisimulation},

institution = {},

year = {1999}

}

### OpenURL

### Abstract

For a process language, featuring nondeterministic and probabilistic choice, a parallel operator and a failure construct, a notion of bisimulation is proposed. As one can interpret recovery from failure with respect to nondeterministic and probabilistic choice in various ways, a single transition system gives rise to several operational models. A uniform way to abstract the `first steps' underlies, for each of these models, the definition of the proposed bisimulation. This bisimulation specializes to Park-Milner bisimulation for the non-probabilistic fragment of the language on the one hand, and to Larsen-Skou bisimulation for the deterministic/probabilistic part of the language, on the other hand. Furthermore, a conditional congruence result is obtained. 1 Introduction Understanding the interplay of nondeterminacy and probability is a key issue in the development of formal techniques for specification and validation of probabilistic programs and protocols. In this paper we study a pr...

### Citations

1371 |
A Calculus of Communicating Systems
- Milner
- 1982
(Show Context)
Citation Context ...ose a notion of bisimulation for the process language that applies to all the models given in [12]. On the one hand the presented process equivalence specializes to classical Park-Milner bisimulation =-=[22, 20]-=- when considering non-probabilistic programs. On the other hand we recover a Larsen-Skou type of bisimulation [18] when restricting to the deterministic/probabilistic part of the language. In probabil... |

1173 |
Modern Graph Theory
- Bollobás
- 2002
(Show Context)
Citation Context ...tss(1;1) : : :s(n;m) such thats(i;j) ? 0 only if (i; j) 2 C and P m j=1s(i 0 ;j) = ae i 0 and P n i=1s(i;j 0 ) = oe j 0 . Proof This lemma is a consequence of the max-flow min-cut theorem (see, e.g., =-=[4]-=-). 2 We can show the following properties of the metric d on SPMS. The first two properties are standard (cf. [2] for example). The third is easy to check using the definition of the lifted \Phi. The ... |

672 |
Concurrency and automata on infinite sequences
- Park
- 1981
(Show Context)
Citation Context ...ose a notion of bisimulation for the process language that applies to all the models given in [12]. On the one hand the presented process equivalence specializes to classical Park-Milner bisimulation =-=[22, 20]-=- when considering non-probabilistic programs. On the other hand we recover a Larsen-Skou type of bisimulation [18] when restricting to the deterministic/probabilistic part of the language. In probabil... |

622 | A compositional approach to performance modelling - Hillston - 1996 |

415 | Bisimulation through probabilistic testing
- Larsen, Skou
- 1991
(Show Context)
Citation Context ...e presented process equivalence specializes to classical Park-Milner bisimulation [22, 20] when considering non-probabilistic programs. On the other hand we recover a Larsen-Skou type of bisimulation =-=[18]-=- when restricting to the deterministic/probabilistic part of the language. In probabilistic process algebra the probabilistic process language PCCS (cf. [9]) is the predominant language and Larsen-Sko... |

278 | Probabilistic simulations for probabilistic processes
- Segala, Lynch
- 1995
(Show Context)
Citation Context ...predominant language and Larsen-Skou bisimulation the standard process equivalence. It is shown [16, 10] that Larsen-Skou bisimulation is a congruence for PCCS. Typical in this and related work, e.g. =-=[5, 15, 23, 14, 21]-=- on testing, satisfaction and simulation relations, is that the process language at hand does not provide nondeterminism, but that probabilistic choice replaces nondeterministic choice instead. In the... |

159 | Reactive, generative, and stratified models of probabilistic processes
- Glabbeek, Smolka, et al.
- 1995
(Show Context)
Citation Context ...the language. In probabilistic process algebra the probabilistic process language PCCS (cf. [9]) is the predominant language and Larsen-Skou bisimulation the standard process equivalence. It is shown =-=[16, 10]-=- that Larsen-Skou bisimulation is a congruence for PCCS. Typical in this and related work, e.g. [5, 15, 23, 14, 21] on testing, satisfaction and simulation relations, is that the process language at h... |

151 |
Time and probability in formal design of distributed systems
- Hansson
- 1994
(Show Context)
Citation Context ...ion and simulation relations, is that the process language at hand does not provide nondeterminism, but that probabilistic choice replaces nondeterministic choice instead. In the alternating model of =-=[11]-=- separation of concerns for the real-time probabilistic process algebra TPCSS is enforced by alternation of probabilistic and nondeterministic layers in the transition system. Also, for the abstract a... |

139 | Labeled Markov Process
- Desharnais
- 1999
(Show Context)
Citation Context ...d by alternation of probabilistic and nondeterministic layers in the transition system. Also, for the abstract approaches based on category theoretic techniques for continuous stochastic systems (see =-=[3, 8, 24]-=-), the functors used can be combined with suitable hyperspace construction and induce a similar stratification. In [19] a probabilistic variant of CSP is studied dealing with nondeterministic choice a... |

98 |
Specification and refinement of probabilistic processes
- Jonsson, Larsen
- 1991
(Show Context)
Citation Context ...predominant language and Larsen-Skou bisimulation the standard process equivalence. It is shown [16, 10] that Larsen-Skou bisimulation is a congruence for PCCS. Typical in this and related work, e.g. =-=[5, 15, 23, 14, 21]-=- on testing, satisfaction and simulation relations, is that the process language at hand does not provide nondeterminism, but that probabilistic choice replaces nondeterministic choice instead. In the... |

76 | Bisimulation for probabilistic transition systems: A coalgebaic approach. TCS
- Vink, Rutten
- 1999
(Show Context)
Citation Context ...d by alternation of probabilistic and nondeterministic layers in the transition system. Also, for the abstract approaches based on category theoretic techniques for continuous stochastic systems (see =-=[3, 8, 24]-=-), the functors used can be combined with suitable hyperspace construction and induce a similar stratification. In [19] a probabilistic variant of CSP is studied dealing with nondeterministic choice a... |

70 |
Equivalences, congruences and complete axiomatizations for probabilistic processes
- Jou, Smolka
- 1990
(Show Context)
Citation Context ...the language. In probabilistic process algebra the probabilistic process language PCCS (cf. [9]) is the predominant language and Larsen-Skou bisimulation the standard process equivalence. It is shown =-=[16, 10]-=- that Larsen-Skou bisimulation is a congruence for PCCS. Typical in this and related work, e.g. [5, 15, 23, 14, 21] on testing, satisfaction and simulation relations, is that the process language at h... |

66 |
Axiomatizing probabilistic processes: ACP with generative probabilities
- Baeten, Bergstra, et al.
- 1995
(Show Context)
Citation Context ...predominant language and Larsen-Skou bisimulation the standard process equivalence. It is shown [16, 10] that Larsen-Skou bisimulation is a congruence for PCCS. Typical in this and related work, e.g. =-=[5, 15, 23, 14, 21]-=- on testing, satisfaction and simulation relations, is that the process language at hand does not provide nondeterminism, but that probabilistic choice replaces nondeterministic choice instead. In the... |

43 | Control flow semantics - Bakker - 1995 |

42 |
Testing equivalence and fully abstract models of probabilistic processes
- Christoff
- 1990
(Show Context)
Citation Context |

35 | On generative parallel composition
- D’Argenio, Hermanns, et al.
- 1999
(Show Context)
Citation Context ...st in their straightforward extensions). In [19] we have found the idea of distinction between nondeterministic and probabilistic nodes, that is typical for the work reported here (see also [12]). In =-=[6]-=-, taking the point of view of performance modeling and quantitative analysis (cf., e.g., [13, 7, 17]) the parallel operator is studied. The induced nondeterminism, however, is resolved in favour of pr... |

35 | P.: A Logical Characterization of Bisimulation for Labeled Markov Processes. LICS
- Desharnais, Edalat, et al.
- 1998
(Show Context)
Citation Context ...d by alternation of probabilistic and nondeterministic layers in the transition system. Also, for the abstract approaches based on category theoretic techniques for continuous stochastic systems (see =-=[3, 8, 24]-=-), the functors used can be combined with suitable hyperspace construction and induce a similar stratification. In [19] a probabilistic variant of CSP is studied dealing with nondeterministic choice a... |

33 | Process Algebra with Probabilistic Choice
- Andova
- 1999
(Show Context)
Citation Context ...e modeling and quantitative analysis (cf., e.g., [13, 7, 17]) the parallel operator is studied. The induced nondeterminism, however, is resolved in favour of probability. In the recent work of Andova =-=[1]-=-, in the alternating approach and incorporating the basic idea underlying [6], a probabilistic process algebra featuring both nondeterministic and probabilistic choice is considered. Furthermore, a so... |

25 |
Quantitative and Qualitative Extensions of Event Structures
- Katoen
- 1996
(Show Context)
Citation Context ...en nondeterministic and probabilistic nodes, that is typical for the work reported here (see also [12]). In [6], taking the point of view of performance modeling and quantitative analysis (cf., e.g., =-=[13, 7, 17]-=-) the parallel operator is studied. The induced nondeterminism, however, is resolved in favour of probability. In the recent work of Andova [1], in the alternating approach and incorporating the basic... |

19 | Acceptance trees for probabilistic processes
- N'unez, Frutos, et al.
- 1995
(Show Context)
Citation Context |

11 | A stochastic automata model and its algebraic approach
- D’Argenio, Katoen, et al.
- 1997
(Show Context)
Citation Context ...en nondeterministic and probabilistic nodes, that is typical for the work reported here (see also [12]). In [6], taking the point of view of performance modeling and quantitative analysis (cf., e.g., =-=[13, 7, 17]-=-) the parallel operator is studied. The induced nondeterminism, however, is resolved in favour of probability. In the recent work of Andova [1], in the alternating approach and incorporating the basic... |

11 | Representing nondeterminism and probabilistic behaviour in reactive processes
- Lowe
- 1993
(Show Context)
Citation Context ...ed on category theoretic techniques for continuous stochastic systems (see [3, 8, 24]), the functors used can be combined with suitable hyperspace construction and induce a similar stratification. In =-=[19]-=- a probabilistic variant of CSP is studied dealing with nondeterministic choice and a parallel operator as well. The analysis there shows that broom and barbed equivalence are no congruences (at least... |

6 | Mixing up nondeterminism and probability: A preliminary report
- Hartog, Vink
- 1998
(Show Context)
Citation Context ...obal nondeterminacy and conditional vs. unconditional probability) within a single framework. Here we propose a notion of bisimulation for the process language that applies to all the models given in =-=[12]-=-. On the one hand the presented process equivalence specializes to classical Park-Milner bisimulation [22, 20] when considering non-probabilistic programs. On the other hand we recover a Larsen-Skou t... |

3 |
Algebraic reasoning for probabilisitic concurrent systems
- Giacalone, Jou, et al.
- 1990
(Show Context)
Citation Context ...recover a Larsen-Skou type of bisimulation [18] when restricting to the deterministic/probabilistic part of the language. In probabilistic process algebra the probabilistic process language PCCS (cf. =-=[9]-=-) is the predominant language and Larsen-Skou bisimulation the standard process equivalence. It is shown [16, 10] that Larsen-Skou bisimulation is a congruence for PCCS. Typical in this and related wo... |