Relational Concurrent Refinement Export

@article{Derrick03, abstract = {Refinement in a concurrent context, as typified by a process algebra, takes a number of different forms depending on what is considered observable. Observations record, 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. Refinement in a state-based language such as Z, on the other hand, is defined using a relational model in terms of the input–output behaviour of abstract programs. These refinements are normally verified by using two simulation rules which help make the verification tractable. This paper unifies these two standpoints by generalising the standard relational model to include additional observable aspects. These are chosen in such a way that they represent exactly the notions of observation embedded in the various concurrent refinement relations. As a consequence, simulation rules for the tractable verification of concurrent refinement can be derived. We develop such simulation rules for failures–divergences refinement and readiness refinement in particular, using an alternative relational model in the latter case.}, author = {Derrick, John and Boiten, Eerke}, citeulike-article-id = {2281481}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/s00165-003-0007-4}, citeulike-linkout-1 = {http://www.cs.kent.ac.uk/pubs/2003/1751/}, day = {1}, doi = {10.1007/s00165-003-0007-4}, journal = {Formal Aspects of Computing}, keywords = {2003, concurrency, data, divergences, failures, finalisation, process-algebra, readiness, refinement, relational, simulation, z}, month = {November}, number = {2}, pages = {182--214}, posted-at = {2008-11-10 10:27:27}, priority = {2}, publisher = {Springer London}, title = {Relational Concurrent Refinement}, url = {http://dx.doi.org/10.1007/s00165-003-0007-4}, volume = {15}, year = {2003} }

TY - JOUR ID - Derrick03 L3 - citeulike-article-id:2281481 N2 - Refinement in a concurrent context, as typified by a process algebra, takes a number of different forms depending on what is considered observable. Observations record, 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. Refinement in a state-based language such as Z, on the other hand, is defined using a relational model in terms of the input–output behaviour of abstract programs. These refinements are normally verified by using two simulation rules which help make the verification tractable. This paper unifies these two standpoints by generalising the standard relational model to include additional observable aspects. These are chosen in such a way that they represent exactly the notions of observation embedded in the various concurrent refinement relations. As a consequence, simulation rules for the tractable verification of concurrent refinement can be derived. We develop such simulation rules for failures–divergences refinement and readiness refinement in particular, using an alternative relational model in the latter case. IS - 2 JF - Formal Aspects of Computing EP - 214 TI - Relational Concurrent Refinement PB - Springer London VL - 15 SP - 182 KW - 2003 KW - concurrency KW - data KW - divergences KW - failures KW - finalisation KW - process-algebra KW - readiness KW - refinement KW - relational KW - simulation KW - z AU - Derrick, John AU - Boiten, Eerke PY - 2003/11/01/ UR - http://dx.doi.org/10.1007/s00165-003-0007-4 ER -