Revivals, stuckness and the hierarchy of CSP models

Journal article

We give details of a new model for CSP introduced in response to work by Fournet et al [C. Fournet, C.A.R. Hoare, S.K. Rajamani and J. Rehof, Stuck-free conformance, Proceedings CAV 04, 16th International Conference on Computer Aided Verification, Boston, USA, July 2004.]. This is the stable revivals model R alluded to in Reed et al (2007, FAC, 19, 3). We provide the full semantics for CSP in this model, indicate why this is operationally congruent, and provide proofs of the full abstraction properties asserted in that paper. We study the place of R in the hierarchy of CSP models, and show how this generates several extensions of R handling infinite behaviours. In doing this we discover more about the hierarchy and several known models within it. This includes results that show that the traces model, failures model and are new one are somehow "essential" or "Platonic". We set out a number of conjectures and challenges for future workers in this area. © 2008 Elsevier Inc. All rights reserved.

Authors: Roscoe, A

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: Elsevier
• Journal: JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING
• Volume: 78
• Issue: 3
• Pages: 163-190
• Publication date: 2009-01-01
• DOI: 10.1016/j.jlap.2008.10.002
• ISSN: 1567-8326
• Language: English
• Keywords: Full abstraction; Concurrency; CSP models