CSP theorems for communicating B machines

Formal Aspects of Computing

Volumn 17, Issue 4, 2005, Pages 390-422

  Schneider, Steve ^a   Treharne, Helen ^a  

^a UNIVERSITY OF SURREY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; CONTROL EQUIPMENT; MATHEMATICAL OPERATORS;

B MACHINES; CSP CONTROLLERS; CSP THEOREMS; HIDING OPERATORS;

THEOREM PROVING;

EID: 28144451855     PISSN: 09345043     EISSN: 1433299X     Source Type: Journal    
DOI: 10.1007/s00165-005-0076-7     Document Type: Conference Paper

References (23)

1. [Abr96a] Abrial J-R (1996) The B-book: assigning programs to meanings. Cambridge University Press
2. [Abr96b] Abrial J-R (1996) Extending B without changing it (for developing distributed systems). In: Habrias H (ed) Proceedings of the first B conference, IRIN, Nantes, pp 169-190
3. [ACM05] Abrial J-R, Cansell D, Méry D (2005) Refinement and reachability in event-B. In: ZB2005, vol LNCS 3455, pp 222-241
4. [BL05] Butler M, Leuschel M (2005) Combining CSP and B for specification and property verification. In: FM'05, vol LNCS 3582, pp 221-236
5. [But00] Butler M (2000) csp2B: A practical approach to combining CSP and B. Formal Asp Comput 12(3):182-198
6. [DS93] Davies JW, Schneider SA (1993) Recursion induction for real-time processes. Formal Asp Comput 5(6):530-553
7. [EST03] Evans N, Schneider SA, Treharne HE (2003) Investigating a file transmission protocol using CSP and B. In: Proceedings of ST.EVE workshop
8. [Fis97] Fischer C (1997) CSP-OZ: A combination of object-Z and CSP. In: Formal methods of open object-based distributed systems, pp 423-438
9. [FL03] Frappier M, Laleau R (2003) Proving event ordering properties for information systems. In: ZB2003, pp 421-436
10. [For97] Formal Systems (Europe) Ltd (1997) Failures-divergences refinement: FDR2 manual
11. [LB03] Leuschel M, Butler M (2003) ProB: A Model Checker for B. In: FM 2003: The 12th international FME symposium, pp 855-874
12. [Mor90] Morgan CC (1990) Of wp and CSP. In: Feijen WHJ, van Gesteren AJM, Gries D, Misra J (eds), Beauty is our business: a birthday salute to Edsger J. Dijkstra. Springer, Berlin Heildelberg New York
13. [OW05] Olderof E-R, Wehrheim H (2005) Specification and (property) inheritance in CSP-OZ. Sci Comput Program 55:227-257
14. [Ros82] Roscoe AW (1982) A mathematical theory of communicating processes. D. Phil Thesis, Oxford University, UK
15. [Ros97] Roscoe AW (1997) The theory and practice of concurrency. Prentice-Hall, Englewood Cliffs, USA
16. [Sca98] Scattergood B (1998) The semantics and implementation of machine-readable CSP. D. Phil Thesis, Oxford University, UK
17. [Sch99] Schneider SA (1999) Concurrent and real-time systems: The CSP approach. Wiley, New York
18. [Sch01] Schneider SA (2001) The B-Method: an introduction. Palgrave, UK
19. [ST02] Schneider SA, Treharne HE (2002) Communicating B machines. In: ZB2002, vol LNCS 2272, pp 416-438
20. [Tre00] Treharne HE (2000) Combining control executives and software specifications. PhD Thesis, Royal Holloway, University of London, UK
21. [TSB03] Treharne HE, Schneider SA, Bramble M (2003) Combining specifications using communication. In: ZB2003, pp 58-78
22. [WC01] Woodcock JCP, Cavalcanti ALC (2001) A concurrent language for refinement. In: Proceedings of the 5th Irish workshop on formal methods, BCS Electronic workshop in Computing, Dublin Ireland
23. [WC02] Woodcock J, Cavalcanti A (2002) The semantics of Circus, In: ZB2002, vol LNCS 2272, pp 184-203