© University of Kent - Contact | Feedback | Legal | FOI | Cookies
Relational concurrent refinement part III: Traces, partial relations and automata
J. Derrick and E.A. Boiten
Formal Aspects of Computing, page 26, September 2012 Accepted for publication.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 framework, 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 defining further embeddings into our relational model: traces, completed traces, failure traces and extension. We then extend our framework to include various
notions of automata based refinement.
Download publication
467 kbytes
(PDF)
Bibtex Record
@article{3251,
author = {J. Derrick and E.A. Boiten},
title = {Relational Concurrent Refinement Part {III}: Traces, partial relations and automata},
month = {September},
year = {2012},
pages = {26},
keywords = {Data refinement, Z, simulations, automata-based refinements, concurrency, traces, completed traces, failures, failure traces, extension.},
note = {Accepted for publication.},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2012/3251},
publication_type = {article},
submission_id = {14499_1345418883},
ISSN = {0934-5043},
journal = {Formal Aspects of Computing},
publisher = {Springer},
}