Bisimulation Maps in Presheaf Categories | Zendy

Harsh Beohar | Zendy; Sebastian Küpper | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Bisimulation Maps in Presheaf Categories

Author(s) -

Harsh Beohar,

Sebastian Küpper

Publication year - 2019

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2019.09.002

Subject(s) - bisimulation , morphism , mathematics , pure mathematics , algebra over a field , theoretical computer science , computer science , discrete mathematics

The category of presheaves on a (small) category is a suitable semantic universe to study behaviour of various dynamical systems. In particular, presheaves can be used to record the executions of a system and their morphisms correspond to simulation maps for various kinds of state-based systems. In this paper, we introduce a notion of bisimulation maps between presheaves (or executions) to capture well known behavioural equivalences in an abstract way. We demonstrate the versatility of this framework by working out the characterisations for standard bisimulation, ∀-fair bisimulation, and branching bisimulation.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research