Truly Concurrent Pi-Calculi with Reversibility, Probabilism and Guards

TL;DR

This paper introduces an advanced truly concurrent pi-calculus that incorporates reversibility, probabilism, and guards, extending traditional process algebras to better model concurrent systems with these features.

Contribution

It extends the truly concurrent pi-calculus $ ext{pi}_{tc}$ by integrating reversibility, probabilism, and guards, providing a more expressive framework for concurrent system modeling.

Findings

Enhanced modeling of reversible concurrent processes

Inclusion of probabilistic behaviors in truly concurrent calculus

Framework supports complex system analysis with guards

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 reversibility, probabilism, and guards into truly concurrent calculus $\pi_{tc}$.