© University of Kent - Contact | Feedback | Legal | FOI | Cookies
Relational concurrent refinement: Timed refinement
John Derrick and Eerke Boiten
In Roberto Bruni and Juergen Dingel, editors, Formal Techniques for Distributed Systems, volume 6722 of Lecture Notes in Computer Science, pages 182-196, Reykjavik, June 2011. Springer [doi].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.Bibtex Record
@conference{3135,
author = {John Derrick and Eerke Boiten},
title = {Relational Concurrent Refinement: Timed Refinement },
month = {June},
year = {2011},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {10.1007/978-3-642-21461-5_8},
url = {http://www.cs.kent.ac.uk/pubs/2011/3135},
publication_type = {conference},
submission_id = {28870_1309267090},
ISBN = {978-3-642-21460-8},
booktitle = {Formal Techniques for Distributed Systems},
editor = {Roberto Bruni and Juergen Dingel},
volume = {6722},
series = {Lecture Notes in Computer Science},
address = {Reykjavik},
publisher = {Springer},
ISSN = {0302-9743},
refereed = {yes},
}