A note on coinduction and weak bisimilarity for while programs

RAIRO - Theoretical Informatics and Applications

Volumn 33, Issue 4-5, 1999, Pages 393-400

  Rutten, J J M M ^a  

^a CWI   (Netherlands)

Author keywords

Automaton; Coalgebra; Coinduction; Weak bisimulation; While program

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL LINGUISTICS;

WEAK BISIMULATION; WHILE PROGRAMS;

COMPUTER SIMULATION;

EID: 0033296699     PISSN: 09883754     EISSN: 1290385X     Source Type: Journal    
DOI: 10.1051/ita:1999125     Document Type: Article

References (5)

1. S.L. Bloom and Z. Esik, The equational logic of fixed points. Theoret. Comput. Sci. 179 (1997) 1-60.
2. J.W. de Bakker, Mathematical theory of program correctness. Prentice-Hall International (1980).
3. C.C. Elgot, Monadic computation and iterative algebraic theories, H.E. Rose and J.C. Shepherdson, Eds., Logic Colloquium’73. North-Holland, Stud. Log. Found. Math. 80 (1975) 175-230.
4. R. Milner, Communication and Concurrency. Prentice Hall International, New York, Prentice Hall Internat. Ser. Comput. Sci. (1989).
5. J.J.M.M. Rutten, Universal coalgebra: A theory of systems. Report CS-R9652, CWI, 1996. FTP-available at Z. Theoret. Comput. Sci., to appear.