Fairness: Monographs in Computer Science
Autor Nissim Francezen Limba Engleză Paperback – 8 oct 2011
Din seria Monographs in Computer Science
- 20% Preț: 511.92 lei
- 20% Preț: 333.22 lei
- 20% Preț: 1285.31 lei
- 20% Preț: 328.60 lei
- 15% Preț: 646.94 lei
- 20% Preț: 357.48 lei
- 20% Preț: 339.47 lei
- 20% Preț: 653.21 lei
- 20% Preț: 329.44 lei
- 20% Preț: 993.74 lei
- 20% Preț: 992.26 lei
- 20% Preț: 1630.95 lei
- 20% Preț: 656.03 lei
- 20% Preț: 650.08 lei
- 20% Preț: 328.09 lei
- 20% Preț: 641.16 lei
- 20% Preț: 334.38 lei
- 18% Preț: 737.74 lei
- 20% Preț: 642.19 lei
- 20% Preț: 641.99 lei
- 20% Preț: 1462.66 lei
- 20% Preț: 345.59 lei
- 20% Preț: 1001.16 lei
- 20% Preț: 711.29 lei
- 20% Preț: 661.47 lei
- 20% Preț: 343.62 lei
- 20% Preț: 644.81 lei
- 15% Preț: 505.30 lei
- 20% Preț: 640.69 lei
- Preț: 396.78 lei
- 18% Preț: 956.81 lei
- 20% Preț: 592.68 lei
- 20% Preț: 329.44 lei
- Preț: 383.33 lei
- 20% Preț: 349.40 lei
- 20% Preț: 832.40 lei
- 20% Preț: 993.42 lei
- 15% Preț: 578.87 lei
- 20% Preț: 337.85 lei
- 20% Preț: 988.16 lei
- 20% Preț: 996.56 lei
- 20% Preț: 1293.37 lei
- 20% Preț: 1452.94 lei
Preț: 333.40 lei
Preț vechi: 416.75 lei
-20% Nou
Puncte Express: 500
Preț estimativ în valută:
63.80€ • 66.21$ • 53.33£
63.80€ • 66.21$ • 53.33£
Carte tipărită la comandă
Livrare economică 15-29 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781461293477
ISBN-10: 1461293472
Pagini: 316
Ilustrații: XIV, 298 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.45 kg
Ediția:Softcover reprint of the original 1st ed. 1986
Editura: Springer
Colecția Springer
Seria Monographs in Computer Science
Locul publicării:New York, NY, United States
ISBN-10: 1461293472
Pagini: 316
Ilustrații: XIV, 298 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.45 kg
Ediția:Softcover reprint of the original 1st ed. 1986
Editura: Springer
Colecția Springer
Seria Monographs in Computer Science
Locul publicării:New York, NY, United States
Public țintă
ResearchCuprins
0 Introduction.- 0.1 Motivation and Background.- 0.2 A Taxonomy of Fairness Concepts.- 0.3 The Language of Guarded Commands (GC).- 1 Termination and Well-Foundedness.- 1.0 Overview.- 1.1 Termination Proofs for Deterministic Programs.- 1.2 Termination Proofs for Nondeterministic Programs.- 2 The Method of Helpful Directions.- 2.0 Introduction to Fair Termination.- 2.1 Ordinal Directed Choice of Helpful Directions.- 2.2 State Directed Choice of Helpful Directions.- 2.3 Inter-reducibility of the Two Methods.- 2.4 Relativized Fair Termination.- 3 The Method of Explicit Scheduler.- 3.0 Overview.- 3.1 Unconditionally-Fair Termination.- 3.2 Weak and Strong Fairness: n Guards.- 3.3 All-Levels Fairness.- 3.4 Comparing Explicit Scheduler with Helpful Directions.- 3.5 More on Fairness and Random Assignments.- 4 Extension and Generalizations of Fairness.- 4.0 Overview.- 4.1 Equifairness.- 4.2 Generalized Fairness.- 4.3 Extreme Fairness.- 4.4 An Analysis of Predicate-Reachability Fairness.- 5 Fair Termination of Concurrent Processes.- 5.1 Overview.- 5.2 Fairness and Communicating Processes.- 5.3 Fairness in Shared-Variables Concurrency.- 6 Syntactic Expressibility.- 6.0 Overview.- 6.1 Fixedpoints of Monotone Transformations.- 6.2 The Assertion Language L?.- 6.3 The Weakest Precondition for Fair Termination.- 6.4 Syntactic Completeness of the SFT Rule.- 6.5 The Ordinal Size for Fair-Termination Proofs.- 7 Fairness in Temporal Logic.- 7.0 Overview.- 7.1 Linear-Time Temporal-Logic (LTL).- 7.2 Branching-Time Temporal-Logics (BTL).- 8 The Functional Approach.- 8.0 Overview.- 8.1 CCS.- 8.2 Fairness and CCS.- 8.3 Weak and Strong Fairness in CCS.- 8.4 A Metric Characterization of CCS Fairness.- 8.5 Finite Delay Operators.- References.- List of Proof Rules.- Author Index.