Beohar, H. orcid.org/0000-0001-5256-1334, König, B., Küpper, S. et al. (2 more authors) (2018) A coalgebraic treatment of conditional transition systems with upgrades. Logical Methods in Computer Science, 14 (1). ISSN 1860-5974
Abstract
We consider conditional transition systems, that model software product lines with upgrades, in a coalgebraic setting. By using Birkhoff's duality for distributive lattices, we derive two equivalent Kleisli categories in which these coalgebras live: Kleisli categories based on the reader and on the so-called lattice monad over Poset. We study two different functors describing the branching type of the coalgebra and investigate the resulting behavioural equivalence. Furthermore we show how an existing algorithm for coalgebra minimisation can be instantiated to derive behavioural equivalences in this setting.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2018 The Authors. This work is licensed under the Creative Commons Attribution-NoDerivs License. To view a copy of this license, visit https://creativecommons.org/licenses/by-nd/4.0/ |
Keywords: | Computer Science; Logic in Computer Science |
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: | 23 Mar 2020 14:58 |
Last Modified: | 23 Mar 2020 14:58 |
Published Version: | http://lmcs.episciences.org/4330 |
Status: | Published |
Publisher: | Logical Methods in Computer Science |
Refereed: | Yes |
Identification Number: | 10.23638/LMCS-14(1:19)2018 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:158383 |