On CSP Refinement Tests That Run Multiple Copies of a Process

Authors:
Gavin Lowe
Affiliations:
Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford, OX1 3QD, UK
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 6
Cited 0

Communicating sequential processes

Communicating sequential processes
Model-checking CSP

A classical mind
The Theory and Practice of Concurrency

The Theory and Practice of Concurrency
Comparing Two Information Flow Security Properties

CSFW '96 Proceedings of the 9th IEEE workshop on Computer Security Foundations
Responsiveness of interoperating components

Formal Aspects of Computing
On the expressive power of CSP refinement

Formal Aspects of Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider CSP stable failures refinement checks, where the right hand side of the refinement contains n copies of a process P. We show that such refinement checks capture precisely those predicates of the form @?f"1,...,f"n@?failures(P)@?R(f"1,...,f"n) for some n-ary relation R. The construction of the refinement test is, in general, infinitary; however, we show how, given R, one can often calculate a finite state refinement check.