Bisimulations of enrichments
| dc.creator | Schmitt, Vincent | |
| dc.creator | Worytkiewicz, Krzysztof | |
| dc.date | 2006-02-21 | |
| dc.date.accessioned | 2026-07-07T07:02:33Z | |
| dc.date.available | 2026-07-07T07:02:33Z | |
| dc.description | In this paper we show that classical notions from automata theory such as simulation and bisimulation can be lifted to the context of enriched categories. The usual properties of bisimulation are nearly all preserved in this new context. The class of enriched functors that correspond to functionnal bisimulations surjective on objects is investigated and appears "nearly" open in the sense of Joyal and Moerdijk. Seeing the change of base techniques as a convenient means to define process refinement/abstractions, we give sufficient conditions for the change of base categories to preserve bisimularity. We apply these concepts to Betti's generalized automata, categorical transition systems, and other exotic categories. | |
| dc.identifier | https://arxiv.org/abs/cs/0602077 | |
| dc.identifier | http://arxiv.org/abs/cs/0602077 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/108643 | |
| dc.subject | Logic in Computer Science | |
| dc.title | Bisimulations of enrichments | |
| dc.type | text |