# More relational refinement: traces and partial relations

Derrick, John, Boiten, Eerke Albert (2008) More relational refinement: traces and partial relations. Electronic Notes in Theoretical Computer Science, 214 . pp. 255-276. ISSN 1571-0661. (doi:10.1016/j.entcs.2008.06.012) (KAR id:23978)

PDF Author's Accepted Manuscript
Language: English
 Preview
Official URL
http://dx.doi.org/10.1016/j.entcs.2008.06.012

## 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. On the other hand, refinement in a process algebra takes a number of different forms depending on the exact notion of observation chosen, which can include the events a system is prepared to accept or refuse. In this paper we continue our program of deriving relational simulation conditions for process algebraic refinement by defining further embeddings into our relational model: traces, completed traces, failure traces and extension.

Item Type: Article 10.1016/j.entcs.2008.06.012 Proceedings of REFINE 2008 (Turku, May 2008) Data refinement, Z, process algebra, simulations, relations Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, Faculties > Sciences > School of Computing > Theoretical Computing Group Eerke Boiten 29 Mar 2010 12:09 UTC 14 Jun 2019 13:56 UTC https://kar.kent.ac.uk/id/eprint/23978 (The current URI for this page, for reference purposes) https://orcid.org/0000-0002-9184-8968