A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
A theory of timewise re nement is presented. This allows the translation of speci cations and proofs of correctness between semantic models, permitting each stage in the veri cation of a system to take place at the appropriate level of abstraction. The theory is presented within the context of CSP. A denotational characterisation of re nement i s g i v en in terms of relations between behaviours at di erent l e v els of abstraction. Various properties for the preservation of re nement throughdoi:10.1007/3-540-58027-1_9 fatcat:blxl2jsrsjgepnnxwrdioy4dxi