Skip to main content

Relational Concurrent Refinement: Automata

Derrick, John, Boiten, Eerke Albert (2009) Relational Concurrent Refinement: Automata. Electronic Notes in Theoretical Computer Science, 259 . pp. 182-196. ISSN 1571-0661. (doi:10.1016/j.entcs.2009.12.015)

PDF - Author's Accepted Manuscript
Download (241kB) Preview
Official URL


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. In models of concurrency, refinement 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, or depend on explicit properties of states and transitions. In this paper we continue our program of deriving relational simulation conditions for behavioural notions of refinement by defining embeddings into the relational model that extend our framework to include various notions of automata based refinement.

Item Type: Article
DOI/Identification number: 10.1016/j.entcs.2009.12.015
Additional information: Proceedings of the 14th BCS-FACS Refinement Workshop (REFINE 2009)
Uncontrolled keywords: determinacy analysis, Craig interpolants
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing > Programming Languages and Systems Group
Depositing User: E. Boiten
Date Deposited: 21 Sep 2012 09:49 UTC
Last Modified: 14 Jun 2019 13:53 UTC
Resource URI: (The current URI for this page, for reference purposes)
Boiten, Eerke Albert:
  • Depositors only (login required):


Downloads per month over past year