Beohar, H. orcid.org/0000-0001-5256-1334 and Küpper, S. (2017) On path-based coalgebras and weak notions of bisimulation. In: Bonchi, F. and König, B., (eds.) 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017), 14-16 Jun 2017, Ljubljana, Slovenia. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik , 6:1-6:17. ISBN 9783959770330
Abstract
It is well known that the theory of coalgebras provides an abstract definition of behavioural equivalence that coincides with strong bisimulation across a wide variety of state-based systems. Unfortunately, the theory in the presence of so-called silent actions is not yet fully developed. In this paper, we give a coalgebraic characterisation of branching (delay) bisimulation in the context of labelled transition systems (fully probabilistic systems). It is shown that recording executions (up to a notion of stuttering), rather than the set of successor states, from a state is sufficient to characterise the respected bisimulation relations in both cases.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Editors: |
|
Copyright, Publisher and Additional Information: | © 2017 The Authors. Licensed under Creative Commons License CC-BY (http://creativecommons.org/licenses/by/4.0). |
Keywords: | Paths; Executions; Branching bisimulation; Coalgebras |
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 12:01 |
Last Modified: | 13 Mar 2020 12:01 |
Status: | Published |
Publisher: | Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik |
Refereed: | Yes |
Identification Number: | 10.4230/LIPIcs.CALCO.2017.6 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:158384 |