@article{ITA_1999__33_4-5_393_0, author = {Rutten, J. J. M. M.}, title = {A note on coinduction and weak bisimilarity for while programs}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, volume = {33}, year = {1999}, pages = {393-400}, mrnumber = {1748663}, zbl = {0945.68073}, language = {en}, url = {http://dml.mathdoc.fr/item/ITA_1999__33_4-5_393_0} }
Rutten, J. J. M. M. A note on coinduction and weak bisimilarity for while programs. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 33 (1999) pp. 393-400. http://gdmltest.u-ga.fr/item/ITA_1999__33_4-5_393_0/
[1] The equational logic of fixed points. Theoret. Comput. Sci. 179 (1997) 1-60. | MR 1454584 | Zbl 0920.03067
and ,[2] Mathematical theory of program correctness. Prentice-Hall International (1980). | MR 603439 | Zbl 0452.68011
,[3] Monadic computation and iterative algebraic theories, H.E. Rose and J.C. Shepherdson, Eds., Logic Colloquium '73. North-Holand, Stud. Log. Found. Math. 80 (1975) 175-230. | MR 413584 | Zbl 0327.02040
,[4] Communication and Concurrency. Prentice Hall International, New York, Prentice Hall Internat. Ser. Comput. Sci. (1989). | Zbl 0683.68008
,[5] Universal coalgebra: A theory of Systems. Report CS-R9652, CWI, 1996. FTP-available at ftp.cwi.nl as pub/CWIreports/AP/CS-R9652.ps.Z. Theoret. Comput. Sci., to appear. | MR 1791953 | Zbl 0951.68038
,[6] Automata and coinduction (an exercise in coalgebra). Report SEN-R9803, CWI, 1998. FTP-available at ftp.cwi.nl as pub/CWIreports/SEN/SEN-R9803.ps.Z. Also in the proceedings of CONCUR '98, Lecture Notes in Comput. Sci. 1466 (1998) 194-218. | MR 1678749 | Zbl 0940.68085
,