Technical Contributions

Stepwise Refinement of Distributed Systems Models, Formalisms, Correctness

Volume 430 of the series Lecture Notes in Computer Science pp 519-543


Multivalued possibilities mappings

  • Nancy A. LynchAffiliated withLaboratory for Computer Science, MIT

* Final gross prices may vary according to local VAT.

Get Access


Abstraction mappings are one of the major tools used to construct correctness proofs for concurrent algorithms. Several examples are given of situations in which it is useful to allow the abstraction mappings to be multivalued. The examples involve algorithm optimization, algorithm distribution, and proofs of time bounds.


abstraction mapping mapping possibilities mapping safety property Alternating Bit Protocol transaction processing garbage collection distributed algorithms time bounds history variables