Advertisement

Formal Aspects of Computing

, Volume 15, Issue 2–3, pp 182–214 | Cite as

Relational Concurrent Refinement

  • John Derrick
  • Eerke Boiten
Article

Abstract

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.

Keywords

Failures–divergences Finalisation Process algebra Readiness Refinement Simulation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© BCS 2003

Authors and Affiliations

  • John Derrick
    • 1
  • Eerke Boiten
    • 1
  1. 1.Computing LaboratoryUniversity of KentCanterburyUK

Personalised recommendations