Beohar, H. orcid.org/0000-0001-5256-1334 and Küpper, S. (2019) Bisimulation maps in presheaf categories. In: König, B., (ed.) Electronic Notes in Theoretical Computer Science. 35th Conference on the Mathematical Foundations of Programming Semantics, 04-07 Jun 2019, London, UK. Elsevier , pp. 5-24.
Abstract
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.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Editors: |
|
Copyright, Publisher and Additional Information: | © 2019 The Author(s). This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/). |
Keywords: | Presheaves; ∀-fair bisimulation; Branching bisimulation |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 13 Mar 2020 11:37 |
Last Modified: | 13 Mar 2020 11:37 |
Status: | Published |
Publisher: | Elsevier |
Refereed: | Yes |
Identification Number: | 10.1016/j.entcs.2019.09.002 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:158375 |