A note on coinduction and weak bisimilarity for while programs

  title={A note on coinduction and weak bisimilarity for while programs},
  author={Jan J. M. M. Rutten},
An illustration of coinduction in terms of a notion of weak bisimilarity is presented. First, an operational semantics O for while programs is defined in terms of a final automaton. It identifies any two programs that are weakly bisimilar, and induces in a canonical manner a compositional model D. Next O = D is proved by coinduction. 1991 Mathematics Subject Classification: 68Q10, 68Q55 1991 Computing Reviews Classification System: D.3, F.1, F.3 
Highly Cited
This paper has 38 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.


Publications citing this paper.
Showing 1-10 of 25 extracted citations


Publications referenced by this paper.
Showing 1-6 of 6 references

Communication and concurrency

PHI Series in computer science • 1989

Mathematical theory of program correctness

Prentice-Hall international series in computer science • 1980

Monadic computation and iterative algebraic theories

C. C. Elgot
Logic Colloquium ’73, • 1975

Similar Papers

Loading similar papers…