2000 character limit reached
Truly Concurrent Calculi with Reversibility, Probabilism and Guards
Published 15 Aug 2021 in cs.LO | (2108.10156v1)
Abstract: The well-known process algebras, such as CCS, ACP and -calculus, capture the interleaving concurrency based on bisimilarity semantics. We did some work on truly concurrent process algebras, such as CTC, APTC and , 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.
Paper Prompts
Sign up for free to create and run prompts on this paper.