Timewise refinement for communicating processes [chapter]

Steve Schneider
1994 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 through
more » ... rallel composition are discussed. An operational characterisation is also given in terms of timed and untimed tests, and observed to coincide with the denotational characterisation.
doi:10.1007/3-540-58027-1_9 fatcat:blxl2jsrsjgepnnxwrdioy4dxi