Simulation as an iterated task

Abstract

This paper applies the convergence algorithm to infinite tasks to derive the notion of simulation of a protocol. It takes a nonterminating protocol and associates with it an infinite task. In a sense, processors executing the protocol may be viewed as solving an infinite task. They produce larger and larger set of views. Their task is to produce a sequence of views corresponding to an execution. Once this is realized, a 'simulation' of the protocol may be regarded to be any set of processors producing larger and larger set of views of the protocol in an order which is compatible with an execution of the protocol.