A note on coinduction and weak bisimilarity for while programs

Rutten, J. J. M. M.

Rutten, J. J. M. M.

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 33 (1999) no. 4-5, pp. 393-400.

MR Zbl

@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},
     pages = {393--400},
     publisher = {EDP-Sciences},
     volume = {33},
     number = {4-5},
     year = {1999},
     mrnumber = {1748663},
     zbl = {0945.68073},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1999__33_4-5_393_0/}
}

TY  - JOUR
AU  - Rutten, J. J. M. M.
TI  - A note on coinduction and weak bisimilarity for while programs
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1999
SP  - 393
EP  - 400
VL  - 33
IS  - 4-5
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1999__33_4-5_393_0/
LA  - en
ID  - ITA_1999__33_4-5_393_0
ER  -

%0 Journal Article
%A Rutten, J. J. M. M.
%T A note on coinduction and weak bisimilarity for while programs
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1999
%P 393-400
%V 33
%N 4-5
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1999__33_4-5_393_0/
%G en
%F 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) no. 4-5, pp. 393-400. http://www.numdam.org/item/ITA_1999__33_4-5_393_0/

Bibliographie
Cité par

[1] S. L. Bloom and Z. Ésik, The equational logic of fixed points. Theoret. Comput. Sci. 179 (1997) 1-60. | MR | Zbl

[2] J. W. De Bakker, Mathematical theory of program correctness. Prentice-Hall International (1980). | MR | Zbl

[3] C. C. Elgot, 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 | Zbl

[4] R. Milner, Communication and Concurrency. Prentice Hall International, New York, Prentice Hall Internat. Ser. Comput. Sci. (1989). | Zbl

[5] J. J. M. M. Rutten, 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 | Zbl

[6] J. J. M. M. Rutten, 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 | Zbl