2021arXiv (Cornell University)Open access

Probabilistic Process Algebra for True Concurrency

Yong Wang

Open full text 0 citations

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 $π_{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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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 $π_{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

Related papers

Back to paper searchBrowse research topicsOriginal source
Probabilistic Process Algebra for True Concurrency — Research Paper | ScholarLens