## Multivalued Possibilities Mappings (1989)

### Cached

### Download Links

- [theory.lcs.mit.edu]
- [theory.lcs.mit.edu]
- DBLP

### Other Repositories/Bibliography

by
Nancy A. Lynch

Venue: | Stepwise Refinement of Distributed Systems, volume LNCS 430 |

Citations: | 13 - 2 self |

### BibTeX

@INPROCEEDINGS{Lynch89multivaluedpossibilities,

author = {Nancy A. Lynch},

title = {Multivalued Possibilities Mappings},

booktitle = {Stepwise Refinement of Distributed Systems, volume LNCS 430},

year = {1989},

pages = {519--543},

publisher = {Springer}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstraction mappings are one of the major tools used to construct correctness proofs for concurrent algorithms. Several examples axe 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.