Volume 630 of the series Lecture Notes in Computer Science pp 355-369


Using CSP to verify a timed protocol over a fair medium

  • Jim DaviesAffiliated withProgramming Research Group, Oxford University
  • , Steve SchneiderAffiliated withProgramming Research Group, Oxford University

* Final gross prices may vary according to local VAT.

Get Access


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.