Handbook of Truly Concurrent Process Algebra
eBook - ePub

Handbook of Truly Concurrent Process Algebra

  1. 600 pages
  2. English
  3. ePUB (mobile friendly)
  4. Available on iOS & Android
eBook - ePub

Handbook of Truly Concurrent Process Algebra

About this book

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 the patterns and verifies the correctness of patterns based on truly concurrent process algebra. 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

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Perlego offers two plans: Essential and Complete
  • Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
  • Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Both plans are available with monthly, semester, or annual billing cycles.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes! You can use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Yes, you can access Handbook of Truly Concurrent Process Algebra by Yong Wang in PDF and/or ePUB format, as well as other popular books in Computer Science & Software Development. We have over one million books available in our catalogue for you to explore.

Table of contents

  1. Title of Book
  2. Cover image
  3. Title page
  4. Table of Contents
  5. Copyright
  6. Chapter 1 Introduction to algebraic theory for reversible computing
  7. Chapter 2 Backgrounds
  8. Chapter 3 Reversible calculus
  9. Chapter 4 Algebraic laws for reversible computing
  10. Chapter 5 Partially reversible calculus
  11. Chapter 6 Algebraic laws for partially reversible computing
  12. Chapter 7 Partially reversible πtcπtc
  13. Chapter 8 Introduction to probabilistic process algebra for true concurrency
  14. Chapter 9 Backgrounds
  15. Chapter 10 A calculus for probabilistic true concurrency
  16. Chapter 11 Algebraic laws for probabilistic true concurrency
  17. Chapter 12 Mobility
  18. Chapter 13 Guards
  19. Chapter 14 CTC with probability and guards
  20. Chapter 15 πtcπtc with probability and guards
  21. Chapter 16 Introduction to actors
  22. Chapter 17 Truly concurrent process algebra
  23. Chapter 18 Process algebra based actor model
  24. Chapter 19 Process algebra based actor model of Map–Reduce
  25. Chapter 20 Process algebra based actor model of the Google File System
  26. Chapter 21 Process algebra based actor model of cloud resource management
  27. Chapter 22 Process algebra based actor model of the Web Service composition
  28. Chapter 23 Process algebra based actor model of the QoS-aware Web Service orchestration engine
  29. Chapter 24 Introduction to secure process algebra
  30. Chapter 25 Secure APTC
  31. Chapter 26 Analyses of key exchange protocols
  32. Chapter 27 Analyses of authentication protocols
  33. Chapter 28 Analyses of practical protocols
  34. Chapter 29 Analyses of other protocols
  35. Chapter 30 Analyses of digital cash protocols
  36. Chapter 31 Analyses of secure elections protocols
  37. Chapter 32 Introduction to verification of patterns
  38. Chapter 33 Verification of architectural patterns
  39. Chapter 34 Verification of design patterns
  40. Chapter 35 Verification of idioms
  41. Chapter 36 Verification of patterns for concurrent and networked objects
  42. Chapter 37 Verification of patterns for resource management
  43. Chapter 38 Composition of patterns
  44. References
  45. Index