Probabilistic Process Algebra for True Concurrency

TL;DR

This paper introduces a probabilistic extension to truly concurrent process algebras, enhancing their ability to model systems with inherent randomness and true concurrency semantics.

Contribution

It extends existing truly concurrent process algebras by incorporating probabilistic features, providing a new framework for modeling concurrent systems with probabilistic behavior.

Findings

Defines probabilistic truly concurrent bisimilarities.

Develops algebraic laws for probabilistic true concurrency.

Enables modeling of systems with both concurrency and randomness.

Abstract

The well-known process algebras, such as CCS, ACP and $\pi$-calculus, capture the interleaving concurrency based on bisimilarity semantics. We did some work on truly concurrent process algebras, such as CTC, APTC and $\pi_{tc}$ , capture the true concurrency based on truly concurrent bisimilarities, such as pomset bisimilarity, step bisimilarity, history-preserving (hp-) bisimilarity and hereditary history-preserving (hhp-) bisimilarity. Truly concurrent process algebras are generalizations of the corresponding traditional process algebras. In this book, we introduce probabilism into truly concurrent process algebras, based on the work on probabilistic process algebra.