Limited Offer
Save 50% on book bundles
Immediately download your ebook while waiting for your print delivery. No promo code needed.
![Book bundle cover eBook and print](https://images.ctfassets.net/ahaoy9whsr8a/3hh8459sY2nXIBbSiKJFQm/ed36678e72516d39f8a78ab741be67ec/book-promo-banner3.png?fm=webp&w=400&q=75)
Algebraic Theory for True Concurrency presents readers with the algebraic laws for true concurrency. Parallelism and concurrency are two of the core concepts within computer… Read more
Limited Offer
Algebraic Theory for True Concurrency presents readers with the algebraic laws for true concurrency. Parallelism and concurrency are two of the core concepts within computer science. This book covers the different realms of concurrency, which enables programs, algorithms or problems to be broken out into order-independent or partially ordered components to improve computation and execution speed. There are two primary approaches for executing concurrency: interleaving concurrency and true concurrency. The main representative of interleaving concurrency is bisimulation/rooted branching bisimulation equivalences which is also readily explored.
This work eventually founded the comprehensive axiomatization modulo bisimulation equivalence -- ACP (Algebra of Communicating Processes).The other approach to concurrency is true concurrency. Research on true concurrency is active and includes many emerging applications. First, there are several truly concurrent bisimulation equivalences, including: pomset bisimulation equivalence, step bisimulation equivalence, history-preserving (hp-) bisimulation equivalence, and hereditary history-preserving (hhp-) bisimulation equivalence, the most well-known truly concurrent bisimulation equivalence.
1. Introduction
2. Semantics and Logic for True Concurrency
2.1 Process algebras
2.1.1 CCS, ACP and CSP
2.1.2 Operational semantics
2.1.3 Proof techniques
2.2 true concurrency
2.2.1 Event structure
2.2.2 Concurrent Bisimilarities
3. A Calculus for True Concurrency
4. Algebraic Laws for True Concurrency
5. A Calculus for Truly Concurrent Mobile Processes
6. Guards
7. Timing
7.1 Discrete relative timing
7.1.1 Basic definitions
7.1.2 Basic algebra for true concurrency with discrete relative timing
7.1.3 Algebra for parallelism in true concurrency with discrete relative timing
7.2 Discrete absolute timing
7.2.1 Basic definitions
7.2.2 Basic algebra for true concurrency with discrete absolute timing
7.2.3 Algebra for parallelism in true concurrency with discrete absolute timing
7.2.4 Discrete Initial Abstraction
7.2.5 Time-dependent conditions
7.3 Continuous relative timing
7.3.1 Basic definitions
7.3.2 Basic algebra for true concurrency with continuous relative timing
7.3.3 BATCSRT with integration
7.3.4 Algebra for parallelism in true concurrency with continuous relative timing
7.3.5 APTCSRT with integration
7.4 Continuous absolute timing
7.4.1 Basic definitions
7.4.2 Basic algebra for true concurrency with continuous absolute timing
7.4.3 BATCSAT with integration
7.4.4 Algebra for parallelism in true concurrency with continuous absolute timing
7.4.5 APTCSAT with integration
7.4.6 Standard initial abstraction
7.4.7 Time-dependent conditions
7.5 Recursion
7.5.1 Discrete relative timing
7.5.2 Discrete absolute timing
7.5.3 Continuous relative timing
7.5.4 Continuous absolute timing
7.6 Abstraction
7.6.1 Discrete relative timing
7.6.2 Discrete absolute timing
7.6.3 Continuous relative timing
7.6.4 Continuous absolute timing
7.7 Applications
7.8 Extensions
YW