Multivalued possibilities mappings

  • Nancy A. Lynch
Technical Contributions

DOI: 10.1007/3-540-52559-9_77

Part of the Lecture Notes in Computer Science book series (LNCS, volume 430)
Cite this paper as:
Lynch N.A. (1990) Multivalued possibilities mappings. In: de Bakker J.W., de Roever W.P., Rozenberg G. (eds) Stepwise Refinement of Distributed Systems Models, Formalisms, Correctness. REX 1989. Lecture Notes in Computer Science, vol 430. Springer, Berlin, Heidelberg


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 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1990

Authors and Affiliations

  • Nancy A. Lynch
    • 1
  1. 1.Laboratory for Computer ScienceMITCambridge

Personalised recommendations