English

Truly Concurrent Calculi with Reversibility, Probabilism and Guards

Logic in Computer Science 2021-08-24 v1

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 πtc\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.

Keywords

Cite

@article{arxiv.2108.10156,
  title  = {Truly Concurrent Calculi with Reversibility, Probabilism and Guards},
  author = {Yong Wang},
  journal= {arXiv preprint arXiv:2108.10156},
  year   = {2021}
}

Comments

251 pages, 28 tables. arXiv admin note: substantial text overlap with arXiv:2107.08453, arXiv:1703.00159, arXiv:1805.03575, arXiv:1704.07774

R2 v1 2026-06-24T05:20:48.709Z