A singleton failures semantics for Communicating Sequential Processes

Authors:
Christie Bolton;Jim Davies
Affiliations:
Oxford University Computing Laboratory, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK;Oxford University Computing Laboratory, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK
Venue:
Formal Aspects of Computing
Year:
2006

Citing 0
Cited 10

Refinement in Object-Z and CSP

IFM '02 Proceedings of the Third International Conference on Integrated Formal Methods
Relational Concurrent Refinement with Internal Operations

Electronic Notes in Theoretical Computer Science (ENTCS)
Generic Tools via General Refinement

Electronic Notes in Theoretical Computer Science (ENTCS)
More Relational Concurrent Refinement: Traces and Partial Relations

Electronic Notes in Theoretical Computer Science (ENTCS)
General Refinement, Part One: Interfaces, Determinism and Special Refinement

Electronic Notes in Theoretical Computer Science (ENTCS)
Relational Concurrent Refinement: Automata

Electronic Notes in Theoretical Computer Science (ENTCS)
A Robust Semantics Hides Fewer Errors

FM '09 Proceedings of the 2nd World Congress on Formal Methods
Recent advances in refinement

ASM'03 Proceedings of the abstract state machines 10th international conference on Advances in theory and practice
Non-atomic refinement in z and CSP

ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
From ODP viewpoint consistency to Integrated Formal Methods

Computer Standards & Interfaces

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper defines a new denotational semantics for the language of Communicating Sequential Processes (CSP). The semantics lies between the existing traces and failures models of CSP, providing a treatment of non-determinism in terms of singleton failures. Although the semantics does not represent a congruence upon the full language, it is adequate for sequential tests of non-deterministic processes. This semantics corresponds exactly to a commonly used notion of data refinement in Z and Object-Z: an abstract data type is refined when the corresponding process is refined in terms of singleton failures. The semantics is used to explore the relationship between data refinement and process refinement, and to derive a rule for data refinement that is both sound and complete.