Relating coalgebraic notions of bisimulation
Logic in Computer Science
2015-07-01 v4
Abstract
The theory of coalgebras, for an endofunctor on a category, has been proposed as a general theory of transition systems. We investigate and relate four generalizations of bisimulation to this setting, providing conditions under which the four different generalizations coincide. We study transfinite sequences whose limits are the greatest bisimulations.
Keywords
Cite
@article{arxiv.1101.4223,
title = {Relating coalgebraic notions of bisimulation},
author = {Sam Staton},
journal= {arXiv preprint arXiv:1101.4223},
year = {2015}
}