Machine-Verifiable Responsiveness

Authors:
J. N. Reed;A. W. Roscoe;J. E. Sinclair
Affiliations:
Department of Information Technology, Armstrong Atlantic State University, Savannah Ga, US;Computing Laboratory, University of Oxford, UK;Department of Computer Science, University of Warwick, UK
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2006

Citing 8
Cited 0

Communicating sequential processes

Communicating sequential processes
Specification-oriented semantics for communicating processes

Acta Informatica
Refusal testing

Theoretical Computer Science
The Theory and Practice of Concurrency

The Theory and Practice of Concurrency
Assume-Guarantee Based Compositional Reasoning for Synchronous Timing Diagrams

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Combining Independent Specifications

FASE '01 Proceedings of the 4th International Conference on Fundamental Approaches to Software Engineering
Responsiveness of interoperating components

Formal Aspects of Computing
On the automatic verification of non-standard measures of consistency

IWFM'03 Proceedings of the 6th international conference on Formal Methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

Individual components in an inter-operating system will require assurance both of appropriate functionality and of responsiveness from other components. 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. To this end we develop a new model of CSP with respect to which such properties are fully abstract.