Responsiveness and stable revivals

Authors:
J. N. Reed;A. W. Roscoe;J. E. Sinclair
Affiliations:
Armstrong Atlantic State University, Department of Information Technology, Savannah, GA, USA;University of Oxford, Computing Laboratory, Oxford, GA, UK;University of Warwick, Department of Computer Science, CV4 7AL, Coventry, GA, UK
Venue:
Formal Aspects of Computing
Year:
2007

Citing 0
Cited 2

On the Unification of Process Semantics: Equational Semantics

Electronic Notes in Theoretical Computer Science (ENTCS)
CSP is a retract of CCS

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Individual components in an inter-operating system require assurance from other components both of appropriate functionality and of suitable responsiveness. We have developed properties which capture the notion of non-blocking responsive behaviour, together with machine-based checks implemented in the CSP model-checker, FDR. In this paper we illustrate the use of our responsiveness properties with a small example, and provide a detailed comparison to related work in CCS. This work has led to the discovery of a new semantic model for CSP with respect to which such properties are fully abstract. We present the new stable revivals model and discuss implications for responsiveness checking.