CSP theorems for communicating B machines
Schneider, S and Treharne, H (2005) CSP theorems for communicating B machines FORMAL ASPECTS OF COMPUTING, 17 (4). pp. 390-422.
Available under License : See the attached licence file.
Plain Text (licence)
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.
|Divisions :||Faculty of Engineering and Physical Sciences > Computing Science|
|Date :||December 2005|
|Identification Number :||https://doi.org/10.1007/s00165-005-0076-7|
|Uncontrolled Keywords :||SPECIFICATION|
|Depositing User :||Symplectic Elements|
|Date Deposited :||20 Oct 2011 09:10|
|Last Modified :||23 Sep 2013 18:45|
Actions (login required)
Downloads per month over past year