Fairness: Monographs in Computer Science
Autor Nissim Francezen Limba Engleză Paperback – 8 oct 2011
Din seria Monographs in Computer Science
- 20%
Preț: 501.54 lei - 20%
Preț: 341.23 lei - 20%
Preț: 315.62 lei - 20%
Preț: 617.20 lei - 20%
Preț: 617.38 lei - 20%
Preț: 630.68 lei - 20%
Preț: 616.39 lei - 20%
Preț: 321.66 lei - 15%
Preț: 621.97 lei - 20%
Preț: 318.67 lei - 20%
Preț: 1396.31 lei - 20%
Preț: 635.90 lei - 20%
Preț: 343.86 lei - 20%
Preț: 1235.26 lei - 20%
Preț: 627.97 lei - 20%
Preț: 326.55 lei - 20%
Preț: 320.55 lei - 20%
Preț: 316.11 lei - 20%
Preț: 332.42 lei - 20%
Preț: 318.67 lei - 20%
Preț: 955.14 lei - 20%
Preț: 683.76 lei - 20%
Preț: 615.94 lei - 20%
Preț: 619.89 lei - 20%
Preț: 957.83 lei - 15%
Preț: 485.89 lei -
Preț: 381.72 lei - 20%
Preț: 336.09 lei - 18%
Preț: 919.67 lei - 20%
Preț: 316.91 lei - 18%
Preț: 709.20 lei -
Preț: 368.79 lei - 20%
Preț: 954.82 lei - 20%
Preț: 800.13 lei - 15%
Preț: 556.58 lei - 20%
Preț: 949.76 lei - 20%
Preț: 316.91 lei - 20%
Preț: 1405.64 lei - 20%
Preț: 962.27 lei - 20%
Preț: 1243.01 lei - 20%
Preț: 569.81 lei - 20%
Preț: 624.95 lei
Preț: 320.72 lei
Preț vechi: 400.90 lei
-20% Nou
Puncte Express: 481
Preț estimativ în valută:
56.75€ • 66.55$ • 49.84£
56.75€ • 66.55$ • 49.84£
Carte tipărită la comandă
Livrare economică 06-20 februarie 26
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.