Probabilistic Process Algebra and Strategic Interleaving

DOI10.7561/SACS.2020.2.205MaRDI QIDQ5089618FDOQ5089618

C. A. Middelburg

Publication date: 19 July 2022

Published in: Scientific Annals of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.10041

zbMATH Keywords

process algebraprobabilistic choiceparallel compositionarbitrary interleavingstrategic interleaving

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (2)

• Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction
• Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?

This page was built for publication: Probabilistic Process Algebra and Strategic Interleaving

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089618)