| Management number | 233491924 | Release Date | 2026/06/27 | List Price | US$61.38 | Model Number | 233491924 | ||
|---|---|---|---|---|---|---|---|---|---|
| Category | |||||||||
Truly Concurrent Process Algebra with Localities introduces localities into truly concurrent process algebras. The book explores all aspects of localities in truly concurrent process algebras, such as Calculus for True Concurrency (CTC), which is a generalization of CCS for true concurrency, Algebra of Parallelism for True Concurrency (APTC), which is a generalization of ACP for true concurrency, and Π Calculus for True Concurrency (Π). Together, these approaches capture the so-called true concurrency based on truly concurrent bisimilarities, such as pomset bisimilarity, step bisimilarity, history-preserving (hp-) bisimilarity and hereditary history-preserving (hhp-) bisimilarity.This book provides readers with all aspects of algebraic theory for localities, including the basis of semantics, calculi for static localities, axiomatization for static localities, as well as calculi for dynamic localities and axiomatization for dynamic localities.- Introduces algebraic properties and laws for localities, one of the important concepts of software engineering for concurrent computing systems- Discusses algebraic theory for static localities and dynamic localities, including the basis of semantics, calculi, and axiomatization- Presents all aspects of localities in truly concurrent process algebras, including Calculus for True Concurrency (CTC), Algebra of Parallelism for True Concurrency (APTC), and Process Calculus for True Concurrency (Π) Read more
| ASIN | B0DF27WKX9 |
|---|---|
| XRay | Not Enabled |
| ISBN13 | 978-0443330698 |
| Language | English |
| File size | 25.3 MB |
| Page Flip | Enabled |
| Publisher | Morgan Kaufmann |
| Word Wise | Not Enabled |
| Print length | 451 pages |
| Accessibility | Learn more |
| Publication date | August 20, 2024 |
| Enhanced typesetting | Enabled |
If you notice any omissions or errors in the product information on this page, please use the correction request form below.
Correction Request Form