Paths and Simulations
Krzysztof Worytkiewicz · Electronic Notes in Theoretical Computer Science · 2003
We study a notion of path simulation among categorical transition systems, a generalized version of labeled transition systems. We then give a characterization in terms of open maps and, in the relevant case where the labels are spans of sets, the relationship to simulations among corresponding categories of evolutions. More algebraic aspects are investigated in a bicategorical setting where path simulations are characterized as binary predicates over cts's, living in a bicategory of cylinders. The latter plays the rôle of a relational structure in this setting.