Using CSP to verify a timed protocol over a fair medium

  • Jim Davies
  • Steve Schneider
Conference paper

DOI: 10.1007/BFb0084803

Part of the Lecture Notes in Computer Science book series (LNCS, volume 630)
Cite this paper as:
Davies J., Schneider S. (1992) Using CSP to verify a timed protocol over a fair medium. In: Cleaveland W. (eds) CONCUR '92. CONCUR 1992. Lecture Notes in Computer Science, vol 630. Springer, Berlin, Heidelberg

Abstract

Standard timed models of CSP are based upon finite observations, and are thus unsuitable for the analysis of fairness conditions. The addition of infinite observations to the standard timed failures model permits an adequate treatment of fairness in a timed context. The resulting model admits a complete proof system for admissible specifications, and supports a theory of timed refinement for untimed programs. This is demonstrated with a study of a familiar protocol—the alternating bit protocol—communicating over an unreliable but fair medium.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1992

Authors and Affiliations

  • Jim Davies
    • 1
  • Steve Schneider
    • 1
  1. 1.Programming Research GroupOxford UniversityOxfordUK

Personalised recommendations