Proc. of the European symposium on programming on ESOP 86
The linear time-branching time spectrum (extended abstract)
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
A process algebraic view of input/output automata
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Forward and backward simulations I.: untimed systems
Information and Computation
Using Z: specification, refinement, and proof
Using Z: specification, refinement, and proof
Handbook of Process Algebra
Test Generation with Inputs, Outputs, and Quiescence
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Refinement in Object-Z and CSP
IFM '02 Proceedings of the Third International Conference on Integrated Formal Methods
Quiescence, Fairness, Testing, and the Notion of Implementation (Extended Abstract)
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
A singleton failures semantics for Communicating Sequential Processes
Formal Aspects of Computing
More Relational Concurrent Refinement: Traces and Partial Relations
Electronic Notes in Theoretical Computer Science (ENTCS)
Data refinement and singleton failures refinement are not equivalent
Formal Aspects of Computing
Relational concurrent refinement part II: Internal operations and outputs
Formal Aspects of Computing
Modelling Divergence in Relational Concurrent Refinement
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
Refinement and reachability in event_b
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
Relational concurrent refinement: timed refinement
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
| Hi-index | 0.00 |
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. In models of concurrency, refinement takes a number of different forms depending on the exact notion of observation chosen, which can include the events a system is prepared to accept or refuse, or depend on explicit properties of states and transitions. In this paper we continue our program of deriving relational simulation conditions for behavioural notions of refinement by defining embeddings into the relational model that extend our framework to include various notions of automata based refinement.