## Model Checking for a Probabilistic Branching Time Logic with Fairness (1998)

### Cached

### Download Links

- [www.cs.bham.ac.uk]
- [www.uni-koblenz.de]
- [miro.informatik.uni-bonn.de]
- [ftp.cs.bham.ac.uk]
- DBLP

### Other Repositories/Bibliography

Venue: | Distributed Computing |

Citations: | 116 - 35 self |

### BibTeX

@ARTICLE{Baier98modelchecking,

author = {Christel Baier and Marta Kwiatkowska},

title = {Model Checking for a Probabilistic Branching Time Logic with Fairness},

journal = {Distributed Computing},

year = {1998},

volume = {11},

pages = {125--155}

}

### Years of Citing Articles

### OpenURL

### Abstract

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...