Truly Concurrent Calculi with Reversibility, Probabilism and Guards

TL;DR

This paper introduces an extended truly concurrent process algebra called CTC that incorporates reversibility, probabilism, and guards, advancing the modeling of concurrent systems beyond traditional interleaving semantics.

Contribution

It extends the CTC calculus with reversibility, probabilism, and guards, providing a more expressive framework for modeling complex concurrent behaviors.

Findings

Extended CTC calculus with reversibility, probabilism, and guards.

Enhanced modeling capabilities for true concurrency.

Foundation for analyzing probabilistic and reversible concurrent systems.

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