Turkenburg, R., Beohar, H. orcid.org/0000-0001-5256-1334, Kupke, C. et al. (1 more author) (Submitted: 2024) Proving behavioural apartness. [Preprint - arXiv] (Submitted)
Abstract
Bisimilarity is a central notion for coalgebras. In recent work, Geuvers and Jacobs suggest to focus on apartness, which they define by dualising coalgebraic bisimulations. This yields the possibility of finite proofs of distinguishability for a wide variety of state-based systems. We propose behavioural apartness, defined by dualising behavioural equivalence rather than bisimulations. A motivating example is the subdistribution functor, where the proof system based on bisimilarity requires an infinite quantification over couplings, whereas behavioural apartness instantiates to a finite rule. In addition, we provide optimised proof rules for behavioural apartness and show their use in several examples.
Metadata
Item Type: | Preprint |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2024 The Author(s). For reuse permissions, please contact the Author(s). |
Keywords: | Philosophy; Pure Mathematics; Mathematical Sciences; Philosophy and Religious Studies |
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: | 21 Jun 2024 08:39 |
Last Modified: | 21 Jun 2024 08:39 |
Status: | Submitted |
Identification Number: | 10.48550/arxiv.2404.16588 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:213741 |