Abstract
We present a simple formulation of Assumption---Commitment reasoning using CSP (Communicating Sequential Processes). An assumption---commitment style property of a process SYS takes the form $COM \sqsubseteq SYS \| ASS $ , for `assumption' and `commitment' processes ASS and COM. We describe proof rules that allow derivation of assumption---commitment style properties of a composite system from such properties of its components, given appropriate side conditions. Most of the rules have a superficially appealing `homomorphic' quality: the overall assumption and commitment processes are composed similarly to the overall system. We also give a `non-homomorphic' rule that corresponds quite well to classical assumption---commitment rules. Antecedants and side conditions can be expressed as refinements and checked separately by the refinement-style model checker FDR. Examples illustrate application of our theory.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
