Derrick, J. and Boiten, E.A. (2012) Relational Concurrent Refinement Part III: Traces, partial relations and automata. Formal Aspects of Computing . ISSN 0934-5043.
|The full text of this publication is not available from this repository. (Contact us about this Publication)|
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.
|Additional information:||Accepted for publication.|
|Uncontrolled keywords:||Data refinement, Z, simulations, automata-based refinements, concurrency, traces, completed traces, failures, failure traces, extension.|
|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:||26 Oct 2012 07:43|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/30788 (The current URI for this page, for reference purposes)|
- Depositors only (login required):