Abstract
A scenario argument is a method to find a bad execution for an algorithm by pasting together parts of several executions, starting from different, carefully selected initial configurations. An adversary chooses these executions so that each process finds certain pairs of executions indistinguishable. These arguments are typically employed when faulty processes can behave in an arbitrary manner. An execution of the algorithm in a hypothetical system architecture is used to describe the behaviour of faulty processes. This execution is not necessarily legal, since the algorithm is not guaranteed to work in this system. We call such an execution a scenario.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Attiya, H., Ellen, F. (2014). Scenario Arguments. In: Impossibility Results for Distributed Computing. Synthesis Lectures on Distributed Computing Theory. Springer, Cham. https://doi.org/10.1007/978-3-031-02010-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-031-02010-0_4
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-00882-5
Online ISBN: 978-3-031-02010-0
eBook Packages: Synthesis Collection of Technology (R0)eBColl Synthesis Collection 5