Relational concurrent refinement part III: traces,partial relations and automata |
| |
Authors: | John Derrick Eerke Boiten |
| |
Affiliation: | 1. Department of Computer Science, University of Sheffield, Sheffield, S1 4DP, UK 2. School of Computing, University of Kent, Canterbury, Kent, CT2 7NF, UK
|
| |
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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|