/

Handbook of Truly Concurrent Process Algebra

Wang Yong
Heftet / 2023 / Engelsk

Produktdetaljer

ISBN
9780443215155
Publisert
2023-12-04
Utgiver
Vendor
Morgan Kaufmann Publishers In
Vekt
450 gr
Høyde
276 mm
Bredde
216 mm
Aldersnivå
P, 06
Språk
Product language
Engelsk
Format
Product format
Heftet
Antall sider
646

Forfatter
Wang Yong

Biographical note

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.

Handbook of Truly Concurrent Process Algebra

Wang Yong
Heftet / 2023 / Engelsk
Wang Yong
Heftet / 2023 / Engelsk
Nettpris:
2.855,-
Laveste pris siste 30 dager: 2.855,-
Ikke i salg
Klikk og hent
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.
Les mer
1. Introduction to algebraic theory for reversible computing 2. Backgrounds 3. Reversible calculus 4. Algebraic laws for reversible computing 5. Partially reversible calculus 6. Algebraic laws for partially reversible computing 7. Partially reversible ptc 8. Introduction to probabilistic process algebra for true concurrency 9. Backgrounds 10. A calculus for probabilistic true concurrency 11. Algebraic laws for probabilistic true concurrency 12. Mobility 13. Guards 14. CTC with probability and guards 15. ptc with probability and guards 16. Introduction to actors 17. Truly concurrent process algebra 18. Process algebra based actor model 19. Process algebra based actor model of Map–Reduce 20. Process algebra based actor model of the Google File System 21. Process algebra based actor model of cloud resource management 22. Process algebra based actor model of the Web Service composition 23. Process algebra based actor model of the QoS-aware Web Service orchestration engine 24. Introduction to secure process algebra 25. Secure APTC 26. Analyses of key exchange protocols 27. Analyses of authentication protocols 28. Analyses of practical protocols 29. Analyses of other protocols 30. Analyses of digital cash protocols 31. Analyses of secure elections protocols 32. Introduction to verification of patterns 33. Verification of architectural patterns 34. Verification of design patterns 35. Verification of idioms 36. Verification of patterns for concurrent and networked objects 37. Verification of patterns for resource management 38. Composition of patterns
Les mer
Presents a detailed and in-depth explanation of the algebra used for concurrent computing
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
Les mer

Relaterte produkter

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.
Les mer
1. Introduction to algebraic theory for reversible computing 2. Backgrounds 3. Reversible calculus 4. Algebraic laws for reversible computing 5. Partially reversible calculus 6. Algebraic laws for partially reversible computing 7. Partially reversible ptc 8. Introduction to probabilistic process algebra for true concurrency 9. Backgrounds 10. A calculus for probabilistic true concurrency 11. Algebraic laws for probabilistic true concurrency 12. Mobility 13. Guards 14. CTC with probability and guards 15. ptc with probability and guards 16. Introduction to actors 17. Truly concurrent process algebra 18. Process algebra based actor model 19. Process algebra based actor model of Map–Reduce 20. Process algebra based actor model of the Google File System 21. Process algebra based actor model of cloud resource management 22. Process algebra based actor model of the Web Service composition 23. Process algebra based actor model of the QoS-aware Web Service orchestration engine 24. Introduction to secure process algebra 25. Secure APTC 26. Analyses of key exchange protocols 27. Analyses of authentication protocols 28. Analyses of practical protocols 29. Analyses of other protocols 30. Analyses of digital cash protocols 31. Analyses of secure elections protocols 32. Introduction to verification of patterns 33. Verification of architectural patterns 34. Verification of design patterns 35. Verification of idioms 36. Verification of patterns for concurrent and networked objects 37. Verification of patterns for resource management 38. Composition of patterns
Les mer
Presents a detailed and in-depth explanation of the algebra used for concurrent computing
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
Les mer

Produktdetaljer

ISBN
9780443215155
Publisert
2023-12-04
Utgiver
Vendor
Morgan Kaufmann Publishers In
Vekt
450 gr
Høyde
276 mm
Bredde
216 mm
Aldersnivå
P, 06
Språk
Product language
Engelsk
Format
Product format
Heftet
Antall sider
646

Forfatter
Wang Yong

Biographical note

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.

Relaterte produkter