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: | Harsh Beohar, Barbara König, Sebastian Küpper, Alexandra Silva, Thorsten Wißmann |
---|---|
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 |
Similar Items
-
Coalgebraic Trace Semantics for Continuous Probabilistic Transition Systems
by: Henning Kerstan, et al.
Published: (2013-12-01) -
Efficient and Modular Coalgebraic Partition Refinement
by: Thorsten Wißmann, et al.
Published: (2020-01-01) -
Coalgebraic Behavioral Metrics
by: Paolo Baldan, et al.
Published: (2018-09-01) -
Bisimulation of Labelled State-to-Function Transition Systems Coalgebraically
by: Diego Latella, et al.
Published: (2015-12-01) -
Bases as Coalgebras
by: Bart Jacobs
Published: (2013-09-01)