Skip to main content
Conference Proceedings

Multivalued possibilities mappings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1990) 430 LNCS 519-543
DOI: 10.1007/3-540-52559-9_77
15Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Lynch, N. A. (1990). Multivalued possibilities mappings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 430 LNCS, pp. 519–543). Springer Verlag. https://doi.org/10.1007/3-540-52559-9_77

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free