Skip to main content
Kent Academic Repository

Relational Concurrent Refinement

Derrick, John, Boiten, Eerke Albert (2003) Relational Concurrent Refinement. Formal Aspects of Computing, 15 (2-3). pp. 182-214. ISSN 0934-5043. (doi:10.1007/s00165-003-0007-4) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:13890)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided.
Official URL:


Refinement in a concurrent context, as typified by a process algebra, takes a number of different forms depending on what is considered observable. Observations record, 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. Refinement in a state-based language such as Z, on the other hand, is defined using a relational model in terms of the input-output behaviour of abstract programs. These refinements are normally verified by using two simulation rules which help make the verification tractable. This paper unifies these two standpoints by generalising the standard relational model to include additional observable aspects. These are chosen in such a way that they represent exactly the notions of observation embedded in the various concurrent refinement relations. As a consequence, simulation rules for the tractable verification of concurrent refinement can be derived. We develop such simulation rules for failures-divergences refinement and readiness refinement in particular, using an alternative relational model in the latter case.

Item Type: Article
DOI/Identification number: 10.1007/s00165-003-0007-4
Uncontrolled keywords: refinement, Z, CSP, failures, refusals, readiness, relations, process algebra, simulations, upward, downward, finalisation
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Eerke Boiten
Date Deposited: 24 Nov 2008 18:00 UTC
Last Modified: 09 Mar 2023 11:30 UTC
Resource URI: (The current URI for this page, for reference purposes)

University of Kent Author Information

Derrick, John.

Creator's ORCID:
CReDIT Contributor Roles:

Boiten, Eerke Albert.

Creator's ORCID:
CReDIT Contributor Roles:
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.