© University of Kent - Contact | Feedback | Legal
The University of Kent, Canterbury, Kent, CT2 7NZ, T +44 (0)1227 764000
Refinement in a concurrent context, for example, as found in a process semantics, takes a number of different forms. Typically this is based on a notion of observation, for example, which events a system is prepared to accept or refuse. Concurrent refinement relations include trace refinement, failures-divergences refinement, readiness refinement and bisimulation.
In this paper we survey recent results linking the relational model of
refinement to the process algebraic models.
Specifically, we detail how variations in the relational framework lead to
relational data refinement being in correspondence with traces-divergences,
singleton failures and failures-divergences refinement in a process semantics.
We then extend these results by showing how the effect of internal operations
can be incorporated into the relational model. As a consequence simulation
rules for failures-divergences refinement can be derived.
@article{2580,
author = {J. Derrick and E.A. Boiten},
title = {Relational Concurrent Refinement with Internal Operations},
month = {July},
year = {2007},
pages = {35-53},
keywords = {Z, CSP, refinement, internal operations, concurrency, divergence},
note = {Proceedings of Refine 2007, the 11th BCS-FACS Refinement Workshop. Editors: B. Aichernig, E.A. Boiten, J. Derrick and L. Groves.},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2007/2580},
publication_type = {article},
submission_id = {3341_1184342652},
ISSN = {15710661},
journal = {Electronic Notes in Theoretical Computer Science},
volume = {187},
}