Affiliation:
1. University of Bologna, Bologna, Italy
Abstract
The origins of bisimulation and bisimilarity are examined, in the three fields where they have been independently discovered: Computer Science, Philosophical Logic (precisely, Modal Logic), Set Theory.
Bisimulation and bisimilarity are coinductive notions, and as such are intimately related to fixed points, in particular greatest fixed points. Therefore also the appearance of coinduction and fixed points is discussed, though in this case only within Computer Science. The paper ends with some historical remarks on the main fixed-point theorems (such as Knaster-Tarski) that underpin the fixed-point theory presented.
Publisher
Association for Computing Machinery (ACM)
Reference134 articles.
1. Aczel P. 1988. Non-Well-Founded Sets. CSLI lecture notes no. 14. Aczel P. 1988. Non-Well-Founded Sets. CSLI lecture notes no. 14.
2. Lecture Notes in Computer Science;Aczel P.
3. Lecture Notes in Computer Science;Alvarez C.,1991
4. Subtyping recursive types
Cited by
109 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献