A coalgebraic treatment of conditional transition systems with upgrades
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...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Logical Methods in Computer Science e.V.
2018-02-01
|
| Series: | Logical Methods in Computer Science |
| Subjects: | |
| Online Access: | https://lmcs.episciences.org/2604/pdf |
| _version_ | 1797268671733694464 |
|---|---|
| author | Harsh Beohar Barbara König Sebastian Küpper Alexandra Silva Thorsten Wißmann |
| author_facet | Harsh Beohar Barbara König Sebastian Küpper Alexandra Silva Thorsten Wißmann |
| author_sort | Harsh Beohar |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-25T01:36:11Z |
| format | Article |
| id | doaj.art-ff394782321c4e8e97e970e7284ab549 |
| institution | Directory Open Access Journal |
| issn | 1860-5974 |
| language | English |
| last_indexed | 2024-04-25T01:36:11Z |
| publishDate | 2018-02-01 |
| publisher | Logical Methods in Computer Science e.V. |
| record_format | Article |
| series | Logical Methods in Computer Science |
| spelling | doaj.art-ff394782321c4e8e97e970e7284ab5492024-03-08T09:53:24ZengLogical Methods in Computer Science e.V.Logical Methods in Computer Science1860-59742018-02-01Volume 14, Issue 110.23638/LMCS-14(1:19)20182604A coalgebraic treatment of conditional transition systems with upgradesHarsh BeoharBarbara KönigSebastian KüpperAlexandra SilvaThorsten WißmannWe 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.https://lmcs.episciences.org/2604/pdfcomputer science - logic in computer science |
| spellingShingle | Harsh Beohar Barbara König Sebastian Küpper Alexandra Silva Thorsten Wißmann A coalgebraic treatment of conditional transition systems with upgrades Logical Methods in Computer Science computer science - logic in computer science |
| title | A coalgebraic treatment of conditional transition systems with upgrades |
| title_full | A coalgebraic treatment of conditional transition systems with upgrades |
| title_fullStr | A coalgebraic treatment of conditional transition systems with upgrades |
| title_full_unstemmed | A coalgebraic treatment of conditional transition systems with upgrades |
| title_short | A coalgebraic treatment of conditional transition systems with upgrades |
| title_sort | coalgebraic treatment of conditional transition systems with upgrades |
| topic | computer science - logic in computer science |
| url | https://lmcs.episciences.org/2604/pdf |
| work_keys_str_mv | AT harshbeohar acoalgebraictreatmentofconditionaltransitionsystemswithupgrades AT barbarakonig acoalgebraictreatmentofconditionaltransitionsystemswithupgrades AT sebastiankupper acoalgebraictreatmentofconditionaltransitionsystemswithupgrades AT alexandrasilva acoalgebraictreatmentofconditionaltransitionsystemswithupgrades AT thorstenwißmann acoalgebraictreatmentofconditionaltransitionsystemswithupgrades AT harshbeohar coalgebraictreatmentofconditionaltransitionsystemswithupgrades AT barbarakonig coalgebraictreatmentofconditionaltransitionsystemswithupgrades AT sebastiankupper coalgebraictreatmentofconditionaltransitionsystemswithupgrades AT alexandrasilva coalgebraictreatmentofconditionaltransitionsystemswithupgrades AT thorstenwißmann coalgebraictreatmentofconditionaltransitionsystemswithupgrades |