Harsh Beohar ; Barbara König ; Sebastian Küpper ; Alexandra Silva ; Thorsten Wißmann - A coalgebraic treatment of conditional transition systems with upgrades

lmcs:2604 - Logical Methods in Computer Science, February 28, 2018, Volume 14, Issue 1 - https://doi.org/10.23638/LMCS-14(1:19)2018
A coalgebraic treatment of conditional transition systems with upgradesArticle

Authors: Harsh Beohar ; Barbara König ; Sebastian Küpper ; Alexandra Silva ; Thorsten Wißmann

    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 $\mathsf{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.


    Volume: Volume 14, Issue 1
    Published on: February 28, 2018
    Accepted on: December 30, 2017
    Submitted on: August 22, 2017
    Keywords: Computer Science - Logic in Computer Science
    Funding:
      Source : OpenAIRE Graph
    • Probabilistic Foundations for Networks; Funder: European Commission; Code: 679127

    1 Document citing this article

    Consultation statistics

    This page has been seen 1769 times.
    This article's PDF has been downloaded 778 times.