Relational Concurrent Refinement: Timed Refinement

Derrick, John and Boiten, Eerke (2011) Relational Concurrent Refinement: Timed Refinement. In: Formal Techniques for Distributed Systems, June 2011, Reykjavik. (The full text of this publication is not available from this repository)

The full text of this publication is not available from this repository. (Contact us about this Publication)
Official URL
http://www.cs.kent.ac.uk/pubs/2011/3135

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 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.

Item Type: Conference or workshop item (Paper)
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Programming Languages and Systems Group
Depositing User: Eerke Boiten
Date Deposited: 21 Sep 2012 09:49
Last Modified: 12 Dec 2013 12:52
Resource URI: http://kar.kent.ac.uk/id/eprint/30757 (The current URI for this page, for reference purposes)
  • Depositors only (login required):