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
We talk in this paper about using state machines and refinement to characterise the visualisation of a computation. We use Z specifications to give examples of systems in the usual way, and then use Z schemas to also represent states and transitions in state machines, which we consider to be a particular kind of visualisation of a specified system. We have investigated the principle of substitutivity and the idea of downward simulation to check whether or not a refinement relation existsdoi:10.1145/2811681.2811702 dblp:conf/aswec/PilbrowR15 fatcat:cxyvrzvbvnbirgsvtfvbw34lum