Relating coalgebraic notions of bisimulation
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...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Logical Methods in Computer Science e.V.
2011-03-01
|
| Series: | Logical Methods in Computer Science |
| Subjects: | |
| Online Access: | https://lmcs.episciences.org/670/pdf |
| _version_ | 1797268768111460352 |
|---|---|
| author | Sam Staton |
| author_facet | Sam Staton |
| author_sort | Sam Staton |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-25T01:37:43Z |
| format | Article |
| id | doaj.art-6f1ad9af3cf94778996b7ce3fa64f805 |
| institution | Directory Open Access Journal |
| issn | 1860-5974 |
| language | English |
| last_indexed | 2024-04-25T01:37:43Z |
| publishDate | 2011-03-01 |
| publisher | Logical Methods in Computer Science e.V. |
| record_format | Article |
| series | Logical Methods in Computer Science |
| spelling | doaj.art-6f1ad9af3cf94778996b7ce3fa64f8052024-03-08T09:14:52ZengLogical Methods in Computer Science e.V.Logical Methods in Computer Science1860-59742011-03-01Volume 7, Issue 110.2168/LMCS-7(1:13)2011670Relating coalgebraic notions of bisimulationSam StatonThe 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.https://lmcs.episciences.org/670/pdfcomputer science - logic in computer sciencef.3.2, g.2.m |
| spellingShingle | Sam Staton Relating coalgebraic notions of bisimulation Logical Methods in Computer Science computer science - logic in computer science f.3.2, g.2.m |
| title | Relating coalgebraic notions of bisimulation |
| title_full | Relating coalgebraic notions of bisimulation |
| title_fullStr | Relating coalgebraic notions of bisimulation |
| title_full_unstemmed | Relating coalgebraic notions of bisimulation |
| title_short | Relating coalgebraic notions of bisimulation |
| title_sort | relating coalgebraic notions of bisimulation |
| topic | computer science - logic in computer science f.3.2, g.2.m |
| url | https://lmcs.episciences.org/670/pdf |
| work_keys_str_mv | AT samstaton relatingcoalgebraicnotionsofbisimulation |