Handbook of Truly Concurrent Process Algebra
- Publisher's listprice EUR 265.00
-
112 413 Ft (107 060 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 20% (cc. 22 483 Ft off)
- Discounted price 89 930 Ft (85 648 Ft + 5% VAT)
112 413 Ft
Availability
printed on demand
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher Morgan Kaufmann
- Date of Publication 4 December 2023
- ISBN 9780443215155
- Binding Paperback
- No. of pages646 pages
- Size 276x215 mm
- Weight 450 g
- Language English 559
Categories
Long description:
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.
Table of Contents:
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 ?tc
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. ?tc 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
Handbook of Truly Concurrent Process Algebra
Subcribe now and receive a favourable price.
Subscribe
112 413 HUF
