Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.