LIMITED OFFER
Save 50% on book bundles
Immediately download your ebook while waiting for your print delivery. No promo code needed.
Handbook of Truly Concurrent Process Algebra
- 1st Edition - December 1, 2023
- Author: Yong Wang
- Language: English
- Paperback ISBN:9 7 8 - 0 - 4 4 3 - 2 1 5 1 5 - 5
- eBook ISBN:9 7 8 - 0 - 4 4 3 - 2 1 5 1 6 - 2
Handbook of Truly Concurrent Process Algebra provides readers with a detailed and in-depth explanation of the algebra used for concurrent computing. This complete handbook… Read more
Purchase options
Institutional subscription on ScienceDirect
Request a sales quoteHandbook of Truly Concurrent Process Algebra provides readers with a detailed and in-depth explanation of the algebra used for concurrent computing. This complete handbook is divided into five Parts: Algebraic Theory for Reversible Computing, Probabilistic Process Algebra for True Concurrency, Actors – A Process Algebra-Based Approach, Secure Process Algebra, and Verification of Patterns. The author demonstrates actor models which are captured using the following characteristics: Concurrency, Asynchrony, Uniqueness, Concentration, Communication Dependency, Abstraction, and Persistence. Every pattern is detailed according to a regular format to be understood and utilized easily, which includes introduction to a pattern and its verifications.
Patterns of the vertical domains are also provided, including the domains of networked objects and resource management. To help readers develop and implement the software patterns scientifically, the pattern languages are also presented.
- Presents all aspects of full algebraic reversible computing, including the basis of semantics, calculi for full reversible computing, and axiomatization for full reversible computing
- Introduces algebraic properties and laws for probabilistic computing, one of the foundational concepts of Computer Science
- Presents the calculi for probabilistic computing, including the basis of semantics and calculi for reversible computing
Software engineers, programmers, and Computer Science researchers in academia and industry working in the field of concurrent computing. Graduate students and some advanced undergraduates taking courses in concurrency and process algebras
- Cover image
- Title page
- Table of Contents
- Copyright
- Chapter 1: Introduction to algebraic theory for reversible computing
- Abstract
- References
- Chapter 2: Backgrounds
- Abstract
- 2.1. Operational semantics
- 2.2. Proof techniques
- 2.3. CTC
- 2.4. πtc
- 2.5. APTC
- 2.6. Forward–reverse truly concurrent bisimulations
- References
- Chapter 3: Reversible calculus
- Abstract
- 3.1. Syntax and operational semantics
- 3.2. Strongly forward–reverse truly concurrent bisimulations
- 3.3. Weakly forward–reverse truly concurrent bisimulations
- Chapter 4: Algebraic laws for reversible computing
- Abstract
- 4.1. Basic reversible algebra for true concurrency
- 4.2. Reversible algebra for parallelism in true concurrency
- 4.3. Abstraction
- References
- Chapter 5: Partially reversible calculus
- Abstract
- 5.1. Syntax and operational semantics
- 5.2. Strongly forward–reverse truly concurrent bisimulations
- 5.3. Weakly forward–reverse truly concurrent bisimulations
- Chapter 6: Algebraic laws for partially reversible computing
- Abstract
- 6.1. Basic algebra for reversible true concurrency
- 6.2. Algebra for parallelism in reversible true concurrency
- 6.3. Recursion
- 6.4. Abstraction
- References
- Chapter 7: Partially reversible πtc
- Abstract
- 7.1. Operational semantics
- 7.2. Syntax and operational semantics
- 7.3. Strong bisimilarities
- 7.4. Algebraic theory
- References
- Chapter 8: Introduction to probabilistic process algebra for true concurrency
- Abstract
- References
- Chapter 9: Backgrounds
- Abstract
- 9.1. Guards
- 9.2. Probabilistic operational semantics for true concurrency
- References
- Chapter 10: A calculus for probabilistic true concurrency
- Abstract
- 10.1. Syntax and operational semantics
- 10.2. Strongly probabilistic truly concurrent bisimulations
- 10.3. Weakly probabilistic truly concurrent bisimulations
- Chapter 11: Algebraic laws for probabilistic true concurrency
- Abstract
- 11.1. Basic algebra for probabilistic true concurrency
- 11.2. Algebra for parallelism in probabilistic true concurrency
- 11.3. Recursion
- 11.4. Abstraction
- References
- Chapter 12: Mobility
- Abstract
- 12.1. Syntax and operational semantics
- 12.2. Strongly probabilistic truly concurrent bisimilarities
- 12.3. Algebraic theory
- References
- Chapter 13: Guards
- Abstract
- 13.1. Operational semantics
- 13.2. BAPTC with guards
- 13.3. APPTC with guards
- 13.4. Recursion
- 13.5. Abstraction
- 13.6. Hoare logic for APPTCG
- References
- Chapter 14: CTC with probability and guards
- Abstract
- 14.1. Operational semantics
- 14.2. Syntax and operational semantics
- 14.3. Strong bisimulations
- 14.4. Weak bisimulations
- Chapter 15: πtc with probability and guards
- Abstract
- 15.1. Operational semantics
- 15.2. Syntax and operational semantics
- 15.3. Strong bisimilarities
- 15.4. Algebraic theory
- References
- Chapter 16: Introduction to actors
- Abstract
- References
- Chapter 17: Truly concurrent process algebra
- Abstract
- 17.1. Process creation
- 17.2. Asynchronous communication
- 17.3. Applications
- References
- Chapter 18: Process algebra based actor model
- Abstract
- 18.1. Modeling characteristics of an actor
- 18.2. Combining all the elements into a whole
- Chapter 19: Process algebra based actor model of Map–Reduce
- Abstract
- 19.1. Requirements of Map–Reduce
- 19.2. The new actor model of Map–Reduce
- Chapter 20: Process algebra based actor model of the Google File System
- Abstract
- 20.1. Requirements of the Google File System
- 20.2. The new actor model of the Google File System
- Chapter 21: Process algebra based actor model of cloud resource management
- Abstract
- 21.1. Requirements of cloud resource management
- 21.2. The new actor model of cloud resource management
- Chapter 22: Process algebra based actor model of the Web Service composition
- Abstract
- 22.1. Requirements of the Web Service composition
- 22.2. The new actor model of Web Service composition
- 22.3. An example
- References
- Chapter 23: Process algebra based actor model of the QoS-aware Web Service orchestration engine
- Abstract
- 23.1. Requirements of the QoS-aware Web Service orchestration engine
- 23.2. The new actor model of the QoS-aware Web Service orchestration engine
- 23.3. An example
- References
- Chapter 24: Introduction to secure process algebra
- Abstract
- References
- Chapter 25: Secure APTC
- Abstract
- 25.1. Symmetric encryption
- 25.2. Asymmetric encryption
- 25.3. Hash
- 25.4. Digital signatures
- 25.5. Message authentication codes
- 25.6. Random sequence generation
- 25.7. Blind signatures
- 25.8. XOR
- 25.9. Extended communications
- 25.10. Analyses of security protocols
- Chapter 26: Analyses of key exchange protocols
- Abstract
- 26.1. Key exchange with symmetric cryptography
- 26.2. Key exchange with public key cryptography
- 26.3. Interlock protocol
- 26.4. Key exchange with digital signatures
- 26.5. Key and message transmission
- 26.6. Key and message broadcast
- Chapter 27: Analyses of authentication protocols
- Abstract
- 27.1. Mutual authentication using the interlock protocol
- 27.2. SKID
- Chapter 28: Analyses of practical protocols
- Abstract
- 28.1. Wide-Mouth Frog protocol
- 28.2. Yahalom protocol
- 28.3. Needham–Schroeder protocol
- 28.4. Otway–Rees protocol
- 28.5. Kerberos protocol
- 28.6. Neuman–Stubblebine protocol
- 28.7. Denning–Sacco protocol
- 28.8. DASS protocol
- 28.9. Woo–Lam protocol
- Chapter 29: Analyses of other protocols
- Abstract
- 29.1. Analyses of secret splitting protocols
- 29.2. Analyses of bit commitment protocols
- 29.3. Analyses of anonymous key distribution protocols
- Chapter 30: Analyses of digital cash protocols
- Abstract
- 30.1. Digital cash protocol 1
- 30.2. Digital cash protocol 2
- 30.3. Digital cash protocol 3
- 30.4. Digital cash protocol 4
- Chapter 31: Analyses of secure elections protocols
- Abstract
- 31.1. Secure elections protocol 1
- 31.2. Secure elections protocol 2
- 31.3. Secure elections protocol 3
- 31.4. Secure elections protocol 4
- 31.5. Secure elections protocol 5
- 31.6. Secure elections protocol 6
- Chapter 32: Introduction to verification of patterns
- Abstract
- References
- Chapter 33: Verification of architectural patterns
- Abstract
- 33.1. From mud to structure
- 33.2. Distributed systems
- 33.3. Interactive systems
- 33.4. Adaptable systems
- Chapter 34: Verification of design patterns
- Abstract
- 34.1. Structural decomposition
- 34.2. Organization of work
- 34.3. Access control
- 34.4. Management
- 34.5. Communication
- Chapter 35: Verification of idioms
- Abstract
- 35.1. Verification of the Singleton pattern
- 35.2. Verification of the Counted Pointer pattern
- Chapter 36: Verification of patterns for concurrent and networked objects
- Abstract
- 36.1. Service access and configuration patterns
- 36.2. Event handling patterns
- 36.3. Synchronization patterns
- 36.4. Concurrency patterns
- Chapter 37: Verification of patterns for resource management
- Abstract
- 37.1. Resource acquisition
- 37.2. Resource Life cycle
- 37.3. Resource release
- Chapter 38: Composition of patterns
- Abstract
- 38.1. Composition of the Layers patterns
- 38.2. Composition of the PAC patterns
- 38.3. Composition of resource management patterns
- References
- References
- Index
- No. of pages: 646
- Language: English
- Edition: 1
- Published: December 1, 2023
- Imprint: Morgan Kaufmann
- Paperback ISBN: 9780443215155
- eBook ISBN: 9780443215162
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 Handbook of Truly Concurrent Process Algebra on ScienceDirect