Verifying Controlled Components.
Schneider, S and Treharne, H (2004) Verifying Controlled Components. In: 4th International Conference on Integrated Formal Methods, 2004 - ?.
|PDF - Accepted Version |
Available under License : See the attached licence file.
|Plain Text (licence)|
Official URL: http://dx.doi.org/10.1007/978-3-540-24756-2_6
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.
|Item Type:||Conference or Workshop Item (UNSPECIFIED)|
|Additional Information:||The original publication is available at http://www.springerlink.com|
|Divisions:||Faculty of Engineering and Physical Sciences > Computing Science|
|Deposited By:||Mr Adam Field|
|Deposited On:||15 Jun 2012 15:36|
|Last Modified:||16 Feb 2013 16:10|
Repository Staff Only: item control page