Acceptance trees for probabilistic processes

Núñez, Manuel; Frutos-Escrig, David de; Díaz, Luis Fernando Llana

doi:10.1007/3-540-60218-6_18

Cited by 26 publications

(10 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…testing preorders [18,39,47,48,60,62], bisimulation [10,36,41,42,55] and various kinds of simulations [8,38,[55][56][57]61]. Several authors presented verification methods for proving qualitative properties of concurrent probabilistic systems (e.g.…”

Section: Related Workmentioning

confidence: 99%

Model checking for a probabilistic branching time logic with fairness

Baier

Kwiatkowska

1998

Distributed Computing

159

205

View full text Add to dashboard Cite

We consider concurrent probabilistic systems, based on probabilistic automata of Segala & Lynch [55], which allow non-deterministic choice between probability distributions. These systems can be decomposed into a collection of "computation trees" which arise by resolving the non-deterministic, but not probabilistic, choices. The presence of non-determinism means that certain liveness properties cannot be established unless fairness is assumed. We introduce a probabilistic branching time logic PBTL, based on the logic TPCTL of Hansson [30] and the logic PCTL of [55], resp. pCTL of [14]. The formulas of the logic express properties such as "every request is eventually granted with probability at least p". We give three interpretations for PBTL on concurrent probabilistic processes: the first is standard, while in the remaining two interpretations the branching time quantifiers are taken to range over a certain kind of fair computation trees. We then present a model checking algorithm for verifying whether a concurrent probabilistic process satisfies a PBTL formula assuming fairness constraints. We also propose adaptations of existing model checking algorithms for pCTL * [4,14] to obtain procedures for PBTL * under fairness constraints. The techniques developed in this paper have applications in automatic verification of randomized distributed systems.

show abstract

Section: Related Workmentioning

confidence: 99%

Model checking for a probabilistic branching time logic with fairness

Baier

Kwiatkowska

1998

Distributed Computing

159

205

View full text Add to dashboard Cite

show abstract

“…In particular, if we concentrate only on probabilistic testing, regardless whether the underlying model is a process algebra or another formalism, several semantics have been defined. This area of research was very active in the previous decade (we can mention [5,35,18,30,29,33,26,12,21,6,31]). Moreover, there also exists recent work on the topic (see, for example [19,3,28,34,4,8]).…”

Section: Introductionmentioning

confidence: 99%

“…In this paper we study different testing semantics for the probabilistic process algebra PPA defined in [30,28]. This process algebra has two choice operators (external and internal), which are extended with a probability.…”

Section: Introductionmentioning

confidence: 99%

A Hierarchy of Equivalences for Probabilistic Processes

Núñez

Llana

2008

Formal Techniques for Networked and Distributed Systems – FORTE 2008

Self Cite

View full text Add to dashboard Cite

Abstract. We study several process equivalences on a probabilistic process algebra. First, we define an operational semantics. Afterwards we introduce the notion of passing a test with a probability. We consider three families of tests according to the intended behavior of an external observer: Reactive (sequential tests), generative (branching tests), and limited generative (equitable branching tests). For each of these families we define three predicates over processes and tests (may-pass, must-pass, passp ) which induce three equivalences. Finally, we relate these nine equivalences and provide either alternative characterizations or fully abstract denotational semantics. These semantic frameworks cover from simple traces to probabilistic acceptance trees.

show abstract

“…Hartog and her colleagues have studied the equivalence between operational and denotational semantics for a variety of probabilistic processes [5,6,7,8] using Banach Space approach [4]. Núñez extended Henessey's "testing semantics" for a variety of probabilistic processes [18,19,20]. As an extension of the guarded command language, a simple probabilistic guarded command language was formalized in [10] under the UTP framework.…”

Section: Introductionmentioning

confidence: 99%

“…As probabilistic computations play an increasing role in solving various problems [21], various proposals on probabilistic languages have been reported [5,6,8,14,13,15,18,19,20]. Complex software systems typically involve important features like real-time, probability and shared-variable concurrency.…”

Section: Introductionmentioning

confidence: 99%

Integrating Probability with Time and Shared-Variable Concurrency

Zhu

Qin

et al. 2006

2006 30th Annual IEEE/NASA Software Engineering Workshop

View full text Add to dashboard Cite

advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Additional information:Use policyThe full-text may be used and/or reproduced, and given to third parties in any format or medium, without prior permission or charge, for personal research or study, educational, or not-for-prot purposes provided that:• a full bibliographic reference is made to the original source • a link is made to the metadata record in DRO • the full-text is not changed in any way The full-text must not be sold in any format or medium without the formal permission of the copyright holders.Please consult the full DRO policy for further details.

show abstract

Acceptance trees for probabilistic processes

Cited by 26 publications

References 8 publications

Model checking for a probabilistic branching time logic with fairness

Model checking for a probabilistic branching time logic with fairness

A Hierarchy of Equivalences for Probabilistic Processes

Integrating Probability with Time and Shared-Variable Concurrency

Contact Info

Product

Resources

About