Handbook of Truly Concurrent Process Algebra

Yong Wang 지음

Elsevier 2023년 12월 15일 출간

작품소개

책소개

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. Truly concurrent process algebras are generalizations of the corresponding traditional process algebras. Handbook of Truly Concurrent Process Algebra introduces several advanced extensions and applications of truly concurrent process algebras. Part 1: Algebraic Theory for Reversible Computing provides readers with all aspects of algebraic theory for reversible computing, including the basis of semantics, calculi for reversible computing, and axiomatization for reversible computing. Part 2: Probabilistic Process Algebra for True Concurrency provides readers with all aspects of probabilistic process algebra for true concurrency, including the basis of semantics, calculi for probabilistic computing, axiomatization for probabilistic computing, as well as mobile calculi for probabilistic computing. Part 3: Actors - A Process Algebra-Based Approach bridges the two concurrent models, process algebra and actors, by capturing the actor model in the following characteristics: Concurrency, Asynchrony, Uniqueness, Concentration, Communication Dependency, Abstraction, and Persistence. Part 4: Secure Process Algebra demonstrates the advantages of process algebra in verifying security protocols – it has a firmly theoretic foundation and rich expressive powers to describe security protocols. Part 5: Verification of Patterns formalizes software patterns according to the categories of

목차

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 ptc8. 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. ptc 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

출판사 서평

작가정보

저자(글) Yong Wang