Skip to main content
Kent Academic Repository

Relational Concurrent Refinement Part III: Traces, partial relations and automata

Derrick, John, Boiten, Eerke Albert (2014) Relational Concurrent Refinement Part III: Traces, partial relations and automata. Formal Aspects of Computing, 26 (2). pp. 407-432. ISSN 0934-5043. (doi:10.1007/s00165-012-0262-3) (KAR id:30788)

PDF (This is the authors' accepted version. The final publication is available at link.springer.com. (Free while in "Online First".)) Author's Accepted Manuscript
Language: English
Download this file
(PDF/495kB)
[thumbnail of This is the authors' accepted version. The final publication is available at link.springer.com. (Free while in "Online First".)]
Preview
Request a format suitable for use with assistive technology e.g. a screenreader
Official URL:
http://dx.doi.org/10.1007/s00165-012-0262-3

Abstract

Data refinement in a state-based language such as Z is defined using a relational model in terms of the behaviour of abstract programs. Downward and upward simulation conditions form a sound and jointly complete methodology to verify relational data refinements, which can be checked on an event-by-event basis rather than per trace. In models of concurrency, refinement is often defined in terms of sets of observations, which can include the events a system is prepared to accept or refuse, or depend on explicit properties of states and transitions. By embedding such concurrent semantics into a relational framework, eventwise verification methods for such refinement relations can be derived. In this paper we continue our program of deriving simulation conditions for process algebraic refinement by defining further embeddings into our relational model: traces, completed traces, failure traces and extension. We then extend our framework to include various notions of automata based refinement.

Item Type: Article
DOI/Identification number: 10.1007/s00165-012-0262-3
Uncontrolled keywords: Data refinement, Z, simulations, automata-based refinements, concurrency, traces, completed traces, failures, failure traces, extension.
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: 21 Sep 2012 09:49 UTC
Last Modified: 16 Feb 2021 12:42 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/30788 (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: https://orcid.org/0000-0002-9184-8968
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.