Computer Science – Logic in Computer Science
Scientific paper
2006-02-21
Computer Science
Logic in Computer Science
Scientific paper
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.
Schmitt Vincent
Worytkiewicz Krzysztof
No associations
LandOfFree
Bisimulations of enrichments does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Bisimulations of enrichments, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bisimulations of enrichments will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-454108