menu
{ "item_title" : "Protocols by Invariants", "item_author" : [" A. A. Schoone", "Anneke A. Schoone", "Schoone Anneke a. "], "item_description" : "Algorithms are a set of rules that specify a sequence of actions to be taken to solve a problem. Distributed algorithms, which are designed to solve many problems at once, are conceptually far more complex than algorithms in a single processing unit environment. When the number of simultaneous events becomes large, human minds cannot keep track of all of them. Naturally, it is necessary to know whether a distributed algorithm will have the desired effect. In this book, Dr. Schoone discusses assertational verification by system-wide invariants for use in verifying the behavior of distributed algorithms. The approach is entirely pragmatic; the author considers many different examples, over a wide range of algorithms and protocols. This volume will be an essential purchase for all those with an interest in distributed algorithms.", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/0/52/160/755/0521607558_b.jpg", "price_data" : { "retail_price" : "62.00", "online_price" : "62.00", "our_price" : "62.00", "club_price" : "62.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Protocols by Invariants|A. A. Schoone

Protocols by Invariants

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

Algorithms are a set of rules that specify a sequence of actions to be taken to solve a problem. Distributed algorithms, which are designed to solve many problems at once, are conceptually far more complex than algorithms in a single processing unit environment. When the number of simultaneous events becomes large, human minds cannot keep track of all of them. Naturally, it is necessary to know whether a distributed algorithm will have the desired effect. In this book, Dr. Schoone discusses assertational verification by system-wide invariants for use in verifying the behavior of distributed algorithms. The approach is entirely pragmatic; the author considers many different examples, over a wide range of algorithms and protocols. This volume will be an essential purchase for all those with an interest in distributed algorithms.

This item is Non-Returnable

Details

  • ISBN-13: 9780521607551
  • ISBN-10: 0521607558
  • Publisher: Cambridge University Press
  • Publish Date: August 2004
  • Dimensions: 9.69 x 7.44 x 0.44 inches
  • Shipping Weight: 0.84 pounds
  • Page Count: 208

Related Categories

You May Also Like...

    1

BAM Customer Reviews