Handbook of Truly Concurrent Process Algebra

AvYong Wang

Häftad, Engelska, 2023

2 873 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

E-bok

4 083 kr

Beskrivning

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 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

Produktinformation

Utgivningsdatum:2023-12-04
Mått:216 x 276 x 39 mm
Vikt:1 740 g
Format:Häftad
Språk:Engelska
Antal sidor:646
Förlag:Elsevier Science
ISBN:9780443215155

Utforska kategorier

Mer om författaren

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.

Innehållsförteckning

1. Introduction to algebraic theory for reversible computing2. Backgrounds3. Reversible calculus4. Algebraic laws for reversible computing5. Partially reversible calculus6. Algebraic laws for partially reversible computing7. Partially reversible πtc8. Introduction to probabilistic process algebra for true concurrency9. Backgrounds10. A calculus for probabilistic true concurrency11. Algebraic laws for probabilistic true concurrency12. Mobility13. Guards14. CTC with probability and guards15. πtc with probability and guards16. Introduction to actors17. Truly concurrent process algebra18. Process algebra based actor model19. Process algebra based actor model of Map–Reduce20. Process algebra based actor model of the Google File System21. Process algebra based actor model of cloud resource management22. Process algebra based actor model of the Web Service composition23. Process algebra based actor model of the QoS-aware Web Service orchestration engine24. Introduction to secure process algebra25. Secure APTC26. Analyses of key exchange protocols27. Analyses of authentication protocols28. Analyses of practical protocols29. Analyses of other protocols30. Analyses of digital cash protocols31. Analyses of secure elections protocols32. Introduction to verification of patterns33. Verification of architectural patterns34. Verification of design patterns35. Verification of idioms36. Verification of patterns for concurrent and networked objects37. Verification of patterns for resource management38. Composition of patterns