Lavoisier S.A.S.
14 rue de Provigny
94236 Cachan cedex
FRANCE

Heures d'ouverture 08h30-12h30/13h30-17h30
Tél.: +33 (0)1 47 40 67 00
Fax: +33 (0)1 47 40 67 02


Url canonique : www.lavoisier.fr/livre/informatique/handbook-of-truly-concurrent-process-algebra/descriptif_4949567
Url courte ou permalien : www.lavoisier.fr/livre/notice.asp?ouvrage=4949567

0 article 

 Frais de port 0,01€*

Exclusivité web : à partir de 35 euros d’achat, frais de port à 1 centime pour les expéditions vers la France métropolitaine, la Suisse et l’UE avec Colissimo ou GLS

Handbook of Truly Concurrent Process Algebra

Langue : Anglais

Auteur :

Couverture de l’ouvrage Handbook of Truly Concurrent Process Algebra

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.

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

Date de parution :

Ouvrage de 646 p.

21.5x27.6 cm

Disponible chez l'éditeur (délai d'approvisionnement : 14 jours).

291,26 €

Ajouter au panier