Probabilistic Process Algebra for True Concurrency
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 probabilism into truly concurrent process algebras, based on the work on probabilistic process algebra.
Cite
@article{arxiv.2107.08453,
title = {Probabilistic Process Algebra for True Concurrency},
author = {Yong Wang},
journal= {arXiv preprint arXiv:2107.08453},
year = {2021}
}
Comments
139 pages, 60 tables. arXiv admin note: substantial text overlap with arXiv:1611.09035, arXiv:2101.05140, arXiv:2104.05438, arXiv:1810.00868, arXiv:1907.02668, arXiv:1811.01070, arXiv:1501.05260, arXiv:1404.0665