On the Borowsky-Gafni Simulation Algorithm (Extended Abstract)

Nancy Lynch Laboratory for Computer Science Massachusetts Institute of Technology Cambridge, MA 02139 [email protected] Sergio Rajsbaum Instituto de Matem aticas, UNAM Ciudad Universitaria D.F. 04510, M exico [email protected] Abstract The first precise description of a version of the BorowskyGafni fault-tolerant simulation algorithm is given, along with a careful description of what it accomplishes and a proof of correctness. The algorithm implements a notion of fault-tolerant reducibility between decision problems. This notion of reducibility is defined, and examples of its use are provided