A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Introduction to the ISO specification language LOTOS
Computer Networks and ISDN Systems - Special Issue: Protocol Specification and Testing
Communication and concurrency
The Z notation: a reference manual
The Z notation: a reference manual
Using Z: specification, refinement, and proof
Using Z: specification, refinement, and proof
Refinement in Z and object-Z: foundations and advanced applications
Refinement in Z and object-Z: foundations and advanced applications
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
An Improved Failures Model for Communicating Processes
Seminar on Concurrency, Carnegie-Mellon University
Refinement of State-Based Concurrent Systems
VDM '90 Proceedings of the Third International Symposium of VDM Europe on VDM and Z - Formal Methods in Software Development
Refinement in Object-Z and CSP
IFM '02 Proceedings of the Third International Conference on Integrated Formal Methods
A hierarchy of failures-based models: theory and application
Theoretical Computer Science - Expressiveness in concurrency
A singleton failures semantics for Communicating Sequential Processes
Formal Aspects of Computing
Modelling Divergence in Relational Concurrent Refinement
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
Hi-index | 0.00 |
Data refinement in a state-based language such as Z is defined using a relational model in terms of the input-output behaviour of abstract programs. Downward and upward simulations form a sound and jointly complete methodology for verifying relational data refinements. Refinement in a concurrent context, for example, as found in a process semantics, takes a number of different forms. Typically this is based on a notion of observation, for example, which events a system is prepared to accept or refuse. Concurrent refinement relations include trace refinement, failures-divergences refinement, readiness refinement and bisimulation. In this paper we survey recent results linking the relational model of refinement to the process algebraic models. Specifically, we detail how variations in the relational framework lead to relational data refinement being in correspondence with traces-divergences, singleton failures and failures-divergences refinement in a process semantics. We then extend these results by showing how the effect of internal operations can be incorporated into the relational model. As a consequence simulation rules for failures-divergences refinement can be derived.