CSP theorems for communicating B machines
From MaRDI portal
Publication:2432218
DOI10.1007/S00165-005-0076-7zbMATH Open1103.68599DBLPjournals/fac/SchneiderT05OpenAlexW1986933799WikidataQ60173603 ScholiaQ60173603MaRDI QIDQ2432218FDOQ2432218
Authors: S. A. Schneider, Helen Treharne 
Publication date: 25 October 2006
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: http://epubs.surrey.ac.uk/7238/2/fullifm.pdf
Recommendations
Cited In (19)
- Laws of mission-based programming
- Responsiveness and stable revivals
- A semantics for behavior trees using CSP with specification commands
- Changing system interfaces consistently: a new refinement strategy for CSP\(\|\)B
- Verification of \(\mathrm{EB}^3\) specifications using CADP
- FM 2005: Formal Methods
- A UTP semantics for communicating processes with shared variables and its formal encoding in PVS
- Integrated Formal Methods
- Relational concurrent refinement. II: Internal operations and outputs
- Chunks: Component Verification in CSP ∥ B
- Title not available (Why is that?)
- Encapsulating formal methods within domain specific languages: a solution for verifying railway scheme plans
- Interactive tool support for CSP \(\parallel\) B consistency checking
- The behavioural semantics of Event-B refinement
- csp2B: A practical approach to combining CSP and B
- Reasoning about resources in the embedded systems language Hume
- Hume box calculus: Robust system development through software transformation
- Changing System Interfaces Consistently: A New Refinement Strategy for CSP||B
- UTP, \textsf{\textit{Circus}}, and Isabelle
Uses Software
This page was built for publication: CSP theorems for communicating B machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2432218)
