Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.DISC.2018.50
URN: urn:nbn:de:0030-drops-98392
URL: https://drops.dagstuhl.de/opus/volltexte/2018/9839/
Goubault, Éric ; Ledent, Jérémy ; Mimram, Samuel
Brief Announcement: On the Impossibility of Detecting Concurrency
| pdf-format: |
|
Abstract
We identify a general principle of distributed computing: one cannot force two processes running in parallel to see each other. This principle is formally stated in the context of asynchronous processes communicating through shared objects, using trace-based semantics. We prove that it holds in a reasonable computational model, and then study the class of concurrent specifications which satisfy this property. This allows us to derive a Galois connection theorem for different variants of linearizability.
BibTeX - Entry
@InProceedings{goubault_et_al:LIPIcs:2018:9839,
author = {{\'E}ric Goubault and J{\'e}r{\'e}my Ledent and Samuel Mimram},
title = {{Brief Announcement: On the Impossibility of Detecting Concurrency}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {50:1--50:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Ulrich Schmid and Josef Widder},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9839},
URN = {urn:nbn:de:0030-drops-98392},
doi = {10.4230/LIPIcs.DISC.2018.50},
annote = {Keywords: concurrent specification, concurrent object, linearizability}
}
| Keywords: | concurrent specification, concurrent object, linearizability | |
| Seminar: | 32nd International Symposium on Distributed Computing (DISC 2018) | |
| Issue date: | 2018 | |
| Date of publication: | 04.10.2018 |
