BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-71-205
       ENTRY:: November 01, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: An algebraic definition of simulation between programs
        TYPE:: Technical Report
      AUTHOR:: Milner, Robin
        DATE:: February 1971
       PAGES:: 23
    ABSTRACT:: A simulation relation between programs is defined which is
               quasi-ordering. Mutual simulation is then an equivalence
               relation, and by dividing out by it we abstract from a
               program such details as how the sequencing is controlled and
               how data is represented. The equivalence classes are
               approxiamtions to the algorithms which are realized, or
               expressed, by their member programs.

               A technique is given and illustrated for proving simulation
               and equivalence of programs; there is an analogy with Floyd's
               technique for proving correctness of programs. Finally,
               necessary and sufficient conditions for simulation are given.
       NOTES:: [Adminitrivia V1/Prg/19951101]
         END:: STAN//CS-TR-71-205