Relational Concurrent Refinement: Timed Refinement - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

Relational Concurrent Refinement: Timed Refinement

(1) , (2)


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 one, 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 considering how notions of time should be embedded into a relational model, and thereby deriving relational notions of timed refinement.
Fichier principal
Vignette du fichier
978-3-642-21461-5_8_Chapter.pdf (300.24 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01583329 , version 1 (07-09-2017)


Attribution - CC BY 4.0



John Derrick, Eerke Boiten. Relational Concurrent Refinement: Timed Refinement. 13th Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS) / 31th International Conference on FORmal TEchniques for Networked and Distributed Systems (FORTE), Jun 2011, Reykjavik,, Iceland. pp.121-137, ⟨10.1007/978-3-642-21461-5_8⟩. ⟨hal-01583329⟩
37 View
63 Download



Gmail Facebook Twitter LinkedIn More