Integrated Formal Methods

Volume 2999 of the series Lecture Notes in Computer Science pp 87-107

Verifying Controlled Components

  • Steve SchneiderAffiliated withDepartment of Computer Science, Royal Holloway, University of London
  • , Helen TreharneAffiliated withDepartment of Computer Science, Royal Holloway, University of London

* Final gross prices may vary according to local VAT.

Get Access


Recent work on combining CSP and B has provided ways of describing systems comprised of components described in both B (to express requirements on state) and CSP (to express interactive and controller behaviour). This approach is driven by the desire to exploit existing tool support for both CSP and B, and by the need for compositional proof techniques. This paper is concerned with the theory underpinning the approach, and proves a number of results for the development and verification of systems described using a combination of CSP and B. In particular, new results are obtained for the use of the hiding operator, which is essential for abstraction. The paper provides theorems which enable results obtained (possibly with tools) on the CSP part of the description to be lifted to the combination. Also, a better understanding of the interaction between CSP controllers and B machines in terms of non-discriminating and open behaviour on channels is introduced, and applied to the deadlock-freedom theorem. The results are illustrated with a toy lift controller running example.