An Algebraic Definition of Simulation Between Programs
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 one abstracts from a program such details as how the sequencing is controlled and how data is presented. 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 of programs. Finally, necessary and sufficient conditions for simulation are given. (Author)
Cite
Text
Milner. "An Algebraic Definition of Simulation Between Programs." International Joint Conference on Artificial Intelligence, 1971.Markdown
[Milner. "An Algebraic Definition of Simulation Between Programs." International Joint Conference on Artificial Intelligence, 1971.](https://mlanthology.org/ijcai/1971/milner1971ijcai-algebraic/)BibTeX
@inproceedings{milner1971ijcai-algebraic,
title = {{An Algebraic Definition of Simulation Between Programs}},
author = {Milner, Robin},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1971},
pages = {481-489},
url = {https://mlanthology.org/ijcai/1971/milner1971ijcai-algebraic/}
}