An algebraic definition of simulation between programs

The equivalence classes are approximations 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 oi programs. Finally, necessary and sufficient conditions for simulation are given. 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. AB - A simulation relation between programs is defined which is quasi-ordering.

Robin Milner. Overview Fingerprint. Parrow, and B. The Concurrency Workbench: a semantics-based tool for the verification of finite-state systems.

Dill, A. Hu, and H. Checking for language inclusion using simulation relations. Emerson and C. The complexity of tree automata and logics of programs. Grumberg and D. Model checking and modular verification. An algebraic theory of fair asynchronous communicating processes. Henzinger, T. Henzinger, and P. Computing simulations on finite and infinite graphs. Kupferman and M. Verification of fair transition systems. Specifying concurrent program modules. Lynch and R.

A comparison of simulation techniques and algebraic techniques for verifying concurrent systems. Lynch and M. Hierarchical correctness proofs for distributed algorithms. Distributed Algorithms. Morgan-Kaufmann, An algebraic definition of simulation between programs.

Natarajan and R. Divergence and fair testing. Linear and branching structures in the semantics and logics of reactive systems. Pnueli and R. On the synthesis of a reactive module. Weakly definable relations and special automata.