Probabilistic Process Algebra for True Concurrency
Yong Wang
Abstract
Open-access reader
Yong Wang
Abstract
Open-access reader
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 $π_{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 probabilism into truly concurrent process algebras, based on the work on probabilistic process algebra.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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 $π_{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 probabilism into truly concurrent process algebras, based on the work on probabilistic process algebra.
Key concepts: Concurrency, Process calculus, Probabilistic logic, Computer science, Process (computing), Algebra over a field, Mathematics, Programming language