Abstract
We extend the stratified model of probabilistic processes 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 only if the non-zero alternatives are precluded by contextual constraints. We refer to this model as one of "extremal probability" and to its signature as PCCSζ. We provide PCCSζ with a structural operational semantics and a notion of probabilistic bisimulation, which is shown to be a congruence. Of particular interest is the abstraction PCCSπ of PCCSζ in which all non-zero probability guards are identified. PCCSπ represents a customized framework for reasoning about priority, and covers all features of process algebras proposed for reasoning about priority that we know of.
| Original language | English |
|---|---|
| Pages (from-to) | 585-606 |
| Number of pages | 22 |
| Journal | Formal Aspects of Computing |
| Volume | 8 |
| Issue number | 5 |
| DOIs | |
| State | Published - 1996 |
Keywords
- Priority
- Probabilistic bisimulation
- Probability
- Synchronous process calculus
Fingerprint
Dive into the research topics of 'Priority as extremal probability'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver