Search

• < Previous
• 1
• Next >

---

A coalgebraic treatment of conditional transition systems with upgrades

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&nbsp;[&hellip;]

---

Minimality Notions via Factorization Systems and Examples

Thorsten Wißmann.

For the minimization of state-based systems (i.e. the reduction of the number of states while retaining the system's semantics), there are two obvious aspects: removing unnecessary states of the system and merging redundant states in the system. In the present article, we relate the two minimization&nbsp;[&hellip;]

---

Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence

Thorsten Wißmann ; Stefan Milius ; Lutz Schröder.

We provide a generic algorithm for constructing formulae that distinguish behaviourally inequivalent states in systems of various transition types such as nondeterministic, probabilistic or weighted; genericity over the transition type is achieved by working with coalgebras for a set functor in the&nbsp;[&hellip;]

---