Skip to main navigation Skip to search Skip to main content

Universal model simulation: BG and extended BG as examples

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper focuses on simulations as a means of deriving the relative power of distributed computing models. We describe an abstract simulation algorithm that enables reducing the question of solvability of a generic distributed task in one model to an equivalent question in another model. The technique implies simple equivalents to the fundamental reduction by Borowsky and Gafni, known as BG simulation, as well as to Extended BG, a more recent extension of it to colored tasks. We also sketch how the parameters of our technique can be tuned to derive recent equivalence results for models that use, in addition to basic read-write memory, k-set agreement or k-process consensus objects, or make assumptions on active resilience.

Original languageEnglish
Title of host publicationStabilization, Safety, and Security of Distributed Systems - 15th International Symposium, SSS 2013, Proceedings
Pages17-31
Number of pages15
DOIs
Publication statusPublished - 1 Dec 2013
Event15th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2013 - Osaka, Japan
Duration: 13 Nov 201316 Nov 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8255 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference15th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2013
Country/TerritoryJapan
CityOsaka
Period13/11/1316/11/13

Fingerprint

Dive into the research topics of 'Universal model simulation: BG and extended BG as examples'. Together they form a unique fingerprint.

Cite this