Автор |
Rutten, J. J.M.M. |
Дата выпуска |
1999 |
dc.description |
An illustration of coinduction in terms of a notion of weak bisimilarity is presented. First, an operational semantics $\mbox{${\cal 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 $\mbox{${\cal D}$}$. Next $\mbox{${\cal O}$}= \mbox{${\cal D}$}$ is proved by coinduction. |
Формат |
application.pdf |
Издатель |
EDP Sciences |
Копирайт |
© EDP Sciences, 1999 |
Тема |
Coalgebra |
Тема |
automaton |
Тема |
weak bisimulation |
Тема |
coinduction |
Тема |
while program. |
Название |
A note on Coinduction and Weak Bisimilarity for While Programs |
Тип |
research-article |
DOI |
10.1051/ita:1999125 |
Electronic ISSN |
1290-385X |
Print ISSN |
0988-3754 |
Журнал |
RAIRO - Theoretical Informatics and Applications |
Том |
33 |
Первая страница |
393 |
Последняя страница |
400 |
Аффилиация |
Rutten J. J.M.M.; CWI, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands; janr@cwi.nl. URL: www.cwi.nl/~janr |
Выпуск |
4-5 |