Algebraic Theory for True Concurrency
- 1st Edition - January 3, 2023
- Imprint: Academic Press
- Author: Yong Wang
- Language: English
- Paperback ISBN:9 7 8 - 0 - 4 4 3 - 1 8 9 1 2 - 8
- eBook ISBN:9 7 8 - 0 - 4 4 3 - 1 8 9 1 3 - 5
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
Purchase options
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.
- Introduces algebraic properties and laws for true concurrency, one of the foundational concepts of computer science
- Presents all aspects of algebraic true concurrency, including the basis of semantics, calculi for true concurrency and for axiomatization
- Integrates all aspects of algebraic theory for true concurrency, along with extensions and applications
Researchers in Computer Science, as well as researchers in applied Mathematics
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
3.1 Syntax and operational semantics
3.1.1 Syntax
3.1.2 Operational semantics
3.2.3 Properties of transitions
3.2 Strongly truly concurrent bisimulations
3.2.1 Basic definitions
3.2.2 Laws and congruence
3.2.3 Recursion
3.3 Weakly truly concurrent bisimulations
3.3.1 Basic definitions
3.3.2 Laws and congruence
3.3.3 Recursion
3.4 Applications
4. Algebraic Laws for True Concurrency
4.1.1 Axiom system of BATC
4.1.2 Properties of BATC
4.1.3 Structured operational semantics of BATC
4.2 Algebra for parallelism in true concurrency
4.2.1 Parallelism as a fundamental computational pattern
4.2.2 Axiom system of parallelism
4.2.3 properties of parallelism
4.2.4 Structured operational semantics of parallelism
4.2.5 Encapsulation
4.3 Recursion
4.3.1 Guarded recursive specifications
4.3.2 Recursive definition and specification principles
4.3.3 Approximation induction principle
4.4 Abstraction
4.4.1 Rooted branching truly concurrent bisimulation equivalence
4.4.2 Guarded linear recursion
4.4.3 Algebraic laws for the silent step
4.4.4 Abstraction
4.4.5 Applications
4.4.6 Extensions
4.4.6.1 Placeholder
4.4.6.2 Renaming
4.4.6.3 States
5. A Calculus for Truly Concurrent Mobile Processes
5.1.1 Syntax
5.1.2 Operational semantics
5.1.3 Properties of transitions
5.2 Strongly truly concurrent bisimularities
5.2.1 Basic definitions
5.2.2 Laws and congruence
5.2.3 Recursion
5.3 Algebraic Theory
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
- Edition: 1
- Published: January 3, 2023
- Imprint: Academic Press
- Language: English
YW
Yong Wang
Dr. Yong Wang is an Associate Professor of Computer Science and Technology, Faculty of Information, at Beijing University of Technology. He holds a PhD in Computer Science from Beihang University, China. He has more than 20 years of research and teaching experience in parallel and distributed computing. Dr. Wang’s research interests include Theory of Parallel Computing, including algebraic theory for true concurrency and its extensions and applications, algebraic theory for reversible computing, and quantum process algebra and its application in quantum communication protocol. Dr. Wang’s other research interests include SOA, grid computing, cloud computing, and big data. Dr. Wang has published more than 120 research papers in leading Computer Science journals, including Wiley-Blackwell International Journal of Communication Systems, Springer International Journal of Theoretical Physics, and IEEE Transactions on Network and Service Management.
Affiliations and expertise
Associate Professor of Computer Science and Technology, Faculty of Information, Beijing University of Technology, ChinaRead Algebraic Theory for True Concurrency on ScienceDirect