Article

Branching bisimulation for probabilistic systems: Characteristics and decidability.

Theor. Comput. Sci 01/2006; 356:325-355. DOI:10.1016/j.tcs.2006.02.010
Source: DBLP

ABSTRACT We address the concept of abstraction in the setting of probabilistic reactive systems, and study its formal underpinnings for the strictly alternating model of Hansson. In particular, we define the notion of branching bisimilarity and study its properties by studying two other equivalence relations, viz. coloured trace equivalence and branching bisimilarity using maximal probabilities. We show that both alternatives coincide with branching bisimilarity. The alternative characterisations have their own merits and focus on different aspects of branching bisimilarity. Coloured trace equivalence can be understood without knowledge of probability theory and is independent of the notion of a scheduler. Branching bisimilarity, rephrased in terms of maximal probabilities gives rise to an algorithm of polynomial complexity for deciding the equivalence. Together they give a better understanding of branching bisimilarity. Furthermore, we show that the notions of branching bisimilarity in the alternating model of Hansson and in the nonalternating model of Segala differ: branching bisimilarity in the latter setting turns out to discriminate between systems that are intuitively branching bisimilar.

0 0
 · 
0 Bookmarks
 · 
55 Views
  • Source
    [show abstract] [hide abstract]
    ABSTRACT: To assess the definitions for "poor ovarian responders" used among randomized trials for the treatment of women with impaired response to stimulation. Systematic review. None. Poor ovarian responders. Treatment modalities for the management of poor ovarian responders. Number and nature of the criteria used to define poor ovarian response to stimulation and threshold values used. Among 47 randomized trials, 41 different definitions for the patients with poor ovarian response have been used. No more than 3 trials used the same definition, whereas even trials from the same research groups used different definitions across different trials. None of the criteria used was adopted in more than 50% of the trials. Age and antral follicle count were adopted only in 9% of the definitions, whereas the criteria of number of follicles on the final stimulation day and number of oocytes retrieved were used in more than 40% of the trials; nonetheless, even for these criteria, the threshold values were consistently different. The variability regarding the definition of poor ovarian responders appears to be striking. Although the Bologna criteria developed by European Society for Human Reproduction and Embryology consensus in 2011 aim to define a consistent group of patients, their applicability needs to be tested through clinical trials. Meanwhile, meta-analyses of the currently available trials should be strongly discouraged because they may lead to the adoption of interventions of ambiguous value.
    Fertility and sterility 11/2011; 96(5):1058-61.e7. · 3.97 Impact Factor
  • [show abstract] [hide abstract]
    ABSTRACT: In this paper, we introduce branching context bisimulation, branching normal bisimulation and branching barbed congruence for higher order pi-calculus. Moreover we prove the equivalence of the three branching bisimulations. At last, we compare branching context bisimulations with other bisimulations for higher order pi-calculus.
    Information Technology and Computer Science, 2009. ITCS 2009. International Conference on; 08/2009
  • Source
    [show abstract] [hide abstract]
    ABSTRACT: A notion of branching bisimilarity for the alternating model of probabilistic systems, compatible with parallel composition, is defined. For a congruence result, an internal transition immediately followed by a non-trivial probability distribution is not considered inert. A weaker definition of branching bisimilarity for the same model has been given earlier. Here we show that our branching bisimulation is the coarsest congruence for parallel composition that is included in the weaker version. To support the use of the present equivalence as a reduction technique, we also show that probabilistic CTL formulae are preserved by our equivalence, and we provide a polynomial-time algorithm deciding branching bisimilarity.
    Theor. Comput. Sci. 01/2012; 413:58-72.

Full-text

View
0 Downloads
Available from

Suzana Andova