Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Butler, M.: csp2B: A practical approach to combining CSP and B. Formal Aspects of Computing 12 (2000)
Evans, N., Schneider, S.A., Treharne, H.E.: Investigating a file transmission protocol using CSP and B. In: proceedings of ST.EVE workshop (2003)
Frappier, M., Laleau, R.: Proving event ordering properties for information systems. In: Bert, D., P. Bowen, J., King, S. (eds.) ZB 2003. LNCS, vol. 2651, pp. 421–436. Springer, Heidelberg (2003)
Formal Systems (Europe) Ltd. Failures-Divergences Refinement: FDR2 Manual (1997)
Morgan, C.C.: Of wp and CSP. In: Feijen, W.H.J., van Gasteren, A.J.M., Gries, D., Misra, J. (eds.) Beauty is our Business: a birthday salute to Edsger J. Dijkstra, Springer, Heidelberg (1990)
Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs (1997)
Scattergood, B.: The Semantics and Implementation of Machine-Readable CSP. D. Phil thesis, Oxford University (1998)
Schneider, S.A.: Concurrent and Real-time Systems: The CSP approach. Wiley, Chichester (1999)
Smith, G., Derrick, J.: Specification, refinement and verification of concurrent systems - an integration of Object-Z and CSP. Formal Methods in System Design 18(3) (2001)
Schneider, S., Treharne, H.: CSP theorems for communicating B machines. Technical Report CSD-TR-02-05, Royal Holloway, University of London (2002)
Schneider, S.A., Treharne, H.E.: Communicating B machines. In: Bert, D., P. Bowen, J., C. Henson, M., Robinson, K. (eds.) B 2002 and ZB 2002. LNCS, vol. 2272, p. 416. Springer, Heidelberg (2002)
Treharne, H.E.: Combining control executives and software specifications. PhD thesis, Royal Holloway, University of London (2000)
Treharne, H.E., Schneider, S.A., Bramble, M.: Combining specifications using communication. In: Bert, D., P. Bowen, J., King, S. (eds.) ZB 2003. LNCS, vol. 2651, pp. 58–78. Springer, Heidelberg (2003)
Woodcock, J.C.P., Cavalcanti, A.L.C.: A concurrent language for refinement. In: 5th Irish Workshop on Formal Methods (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schneider, S., Treharne, H. (2004). Verifying Controlled Components. In: Boiten, E.A., Derrick, J., Smith, G. (eds) Integrated Formal Methods. IFM 2004. Lecture Notes in Computer Science, vol 2999. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24756-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-24756-2_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21377-2
Online ISBN: 978-3-540-24756-2
eBook Packages: Springer Book Archive