Synthesis of two-party error-recoverable protocols

  • Authors:
  • C V Ramamoorthy;Y Yaw;R Aggarwal;J Song

  • Affiliations:
  • Computer Science Division, Department of Electrical Engineering and Computer Science, University of California, Berkeley, California;Computer Science Division, Department of Electrical Engineering and Computer Science, University of California, Berkeley, California;Computer Science Division, Department of Electrical Engineering and Computer Science, University of California, Berkeley, California;Computer Science Division, Department of Electrical Engineering and Computer Science, University of California, Berkeley, California

  • Venue:
  • SIGCOMM '86 Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
  • Year:
  • 1986

Quantified Score

Hi-index 0.00

Visualization

Abstract

We have developed a correct, general, and efficient procedure of synthesizing two-party error-recoverable protocols for noisy channels where messages could be lost, corrupted, and/or missequenced. The state explosion problem has been tackled by synthesizing the error-recoverable protocol (ERP) from its noiseless local entity model using certain rules. This reduction arises from the approaches of local modeling and elaboration. We expect that these two approaches will also play a major role in tackling the complexity problems in designing multi-party protocols. Measures of efficiency and functionality improvements have been discussed.