Abstract
A process is poised at an object if it will apply a primitive to the object when it is next allocated a step by the scheduler. If the value of the object resulting from applying this primitive does not depend on its current value, then the information stored in the object will be obliterated. In this case, we say that the primitive is historyless and the process covers the object.
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). Covering 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_6
Download citation
DOI: https://doi.org/10.1007/978-3-031-02010-0_6
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