Communicating sequential processes
Communicating sequential processes
Extensional equivalence for transition systems
Acta Informatica
Introduction to the ISO specification language LOTOS
Computer Networks and ISDN Systems - Special Issue: Protocol Specification and Testing
Using Z: specification, refinement, and proof
Using Z: specification, refinement, and proof
Communication and Concurrency
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Handbook of Process Algebra
Proceedings of the IFIP WG6.1 Ninth International Symposium on Protocol Specification, Testing and Verification IX
ESOP '86 Proceedings of the European Symposium on Programming
A Testing Theory for LOTOS using Deadlock Detection
Proceedings of the IFIP WG6.1 Ninth International Symposium on Protocol Specification, Testing and Verification IX
The Linear Time-Branching Time Spectrum (Extended Abstract)
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Refinement in Object-Z and CSP
IFM '02 Proceedings of the Third International Conference on Integrated Formal Methods
A singleton failures semantics for Communicating Sequential Processes
Formal Aspects of Computing
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
Data Refinement: Model-Oriented Proof Methods and their Comparison
Data Refinement: Model-Oriented Proof Methods and their Comparison
Refinement and reachability in event_b
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
Modelling Divergence in Relational Concurrent Refinement
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
Relational Concurrent Refinement: Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
A note on traces refinement and the conf relation in the unifying theories of programming
UTP'08 Proceedings of the 2nd international conference on Unifying theories of programming
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. On the other hand, refinement in a process algebra 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. In this paper we continue our program of deriving relational simulation conditions for process algebraic refinement by defining further embeddings into our relational model: traces, completed traces, failure traces and extension.