A termék adatai:
| ISBN13: | 9780443330681 |
| ISBN10: | 0443330689 |
| Kötéstípus: | Puhakötés |
| Terjedelem: | 474 oldal |
| Méret: | 234x190 mm |
| Súly: | 960 g |
| Nyelv: | angol |
| 664 |
Témakör:
Truly Concurrent Process Algebra With Localities
Kiadó: Morgan Kaufmann
Megjelenés dátuma: 2024. augusztus 23.
Normál ár:
Kiadói listaár:
EUR 204.99
EUR 204.99
Az Ön ára:
80 197 (76 379 Ft + 5% áfa )
Kedvezmény(ek): 10% (kb. 8 911 Ft)
A kedvezmény csak az 'Értesítés a kedvenc témákról' hírlevelünk címzettjeinek rendeléseire érvényes.
Kattintson ide a feliratkozáshoz
Kattintson ide a feliratkozáshoz
Beszerezhetőség:
Megrendelésre a kiadó utánnyomja a könyvet. Rendelhető, de a szokásosnál kicsit lassabban érkezik meg.
Nem tudnak pontosabbat?
Hosszú leírás:
Truly Concurrent Process Algebra with Localities introduces localities into truly concurrent process algebras. The book explores all aspects of localities in truly concurrent process algebras, such as Calculus for True Concurrency (CTC), which is a generalization of CCS for true concurrency, Algebra of Parallelism for True Concurrency (APTC), which is a generalization of ACP for true concurrency, and ? Calculus for True Concurrency (?). Together, these approaches capture the so-called true concurrency based on truly concurrent bisimilarities, such as pomset bisimilarity, step bisimilarity, history-preserving (hp-) bisimilarity and hereditary history-preserving (hhp-) bisimilarity.
This book provides readers with all aspects of algebraic theory for localities, including the basis of semantics, calculi for static localities, axiomatization for static localities, as well as calculi for dynamic localities and axiomatization for dynamic localities.
This book provides readers with all aspects of algebraic theory for localities, including the basis of semantics, calculi for static localities, axiomatization for static localities, as well as calculi for dynamic localities and axiomatization for dynamic localities.
Tartalomjegyzék:
1. Introduction
2. Backgrounds
3. Location-related Bisimulation Semantics for True Concurrency
4. CTC with Localities
5. APTC with Localities
6. PItc with Localities
7. Probabilistic Location-related Bisimulation Semantics for True Concurrency
8. CTC with Localities and Probability
9. APTC with Localities and Probability
10. PItc with Localities and Probability
11. Reversible Location-related Bisimulation Semantics for True Concurrency
12. Reversible CTC with Localities
13. Reversible APTC with Localities
14. Reversible tc with Localities
15. Location-related Bisimulation Semantics for True Concurrency
16. CTC with Localities and Guards
17. APTC with Localities and Guards
18. PItc with Localities and Guards
2. Backgrounds
3. Location-related Bisimulation Semantics for True Concurrency
4. CTC with Localities
5. APTC with Localities
6. PItc with Localities
7. Probabilistic Location-related Bisimulation Semantics for True Concurrency
8. CTC with Localities and Probability
9. APTC with Localities and Probability
10. PItc with Localities and Probability
11. Reversible Location-related Bisimulation Semantics for True Concurrency
12. Reversible CTC with Localities
13. Reversible APTC with Localities
14. Reversible tc with Localities
15. Location-related Bisimulation Semantics for True Concurrency
16. CTC with Localities and Guards
17. APTC with Localities and Guards
18. PItc with Localities and Guards