Communicating B machines

DOI10.1007/3-540-45648-1_22MaRDI QIDQ4472199zbMATH OpenFDO

Authors Helen Treharne, S. A. Schneider

Publication date 3 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2272/22720416.htm, https://openresearch.surrey.ac.uk/view/delivery/44SUR_INST/12138722850002346/13140212030002346

zbMATH Keywords

B-MethodCombining FormalismsConcurrencyCSP

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Composing specifications using communication
• CSP theorems for communicating B machines
• Integrated Formal Methods
• Interactive tool support for CSP \(\parallel\) B consistency checking
• Using a process algebra to control B OPERATIONS

Cited in

(10)

• Communication for alternating machines
• Model transformations across views
• Efficient symbolic computation of process expressions
• CSP theorems for communicating B machines
• Integrating a formal method into a software engineering process with UML and Java
• Interactive tool support for CSP \(\parallel\) B consistency checking
• Extending B with control flow breaks
• Global and communicating state machine models in event driven B: A simple railway case study
• Test selection for traces refinement
• Integrated Formal Methods

This page was built for publication: Communicating B machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472199)