RAIRO-Theor. Inf. Appl.
Volume 33, Number 4-5, July October 1999
|Page(s)||393 - 400|
|Published online||15 August 2002|
A note on Coinduction and Weak Bisimilarity for While Programs
P.O. Box 94079, 1090 GB Amsterdam, The Netherlands;
email@example.com. URL: www.cwi.nl/~janr
Revised: 26 April 1999
An illustration of coinduction in terms of a notion of weak bisimilarity is presented. First, an operational semantics 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 . Next is proved by coinduction.
Mathematics Subject Classification: 68Q10 / 68Q55
Key words: Coalgebra / automaton / weak bisimulation / coinduction / while program.
© EDP Sciences, 1999
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.