CSP theorems for communicating B machines
From MaRDI portal
Publication:2432218
DOI10.1007/s00165-005-0076-7zbMath1103.68599OpenAlexW1986933799WikidataQ60173603 ScholiaQ60173603MaRDI QIDQ2432218
Helen Treharne, S. A. Schneider
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
Related Items
Verification of \(\mathrm{EB}^3\) specifications using CADP, Reasoning About Resources in the Embedded Systems Language Hume, Responsiveness and stable revivals, Interactive tool support for CSP \(\parallel\) B consistency checking, Hume box calculus: Robust system development through software transformation, Encapsulating formal methods within domain specific languages: a solution for verifying railway scheme plans, Changing system interfaces consistently: a new refinement strategy for CSP\(\|\)B, A semantics for behavior trees using CSP with specification commands, Changing System Interfaces Consistently: A New Refinement Strategy for CSP||B, A UTP semantics for communicating processes with shared variables and its formal encoding in PVS, The behavioural semantics of Event-B refinement, Relational concurrent refinement. II: Internal operations and outputs, Laws of mission-based programming
Uses Software
