Search

• < Previous
• 1
• Next >

---

Coalgebraic Trace Semantics for Continuous Probabilistic Transition Systems

Henning Kerstan ; Barbara König.

Coalgebras in a Kleisli category yield a generic definition of trace semantics for various types of labelled transition systems. In this paper we apply this generic theory to generative probabilistic transition systems, short PTS, with arbitrary (possibly uncountable) state spaces. We consider the&nbsp;[&hellip;]

---

Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets

Paolo Baldan ; Andrea Corradini ; Hartmut Ehrig ; Reiko Heckel ; Barbara König.

We propose a framework for the specification of behaviour-preserving reconfigurations of systems modelled as Petri nets. The framework is based on open nets, a mild generalisation of ordinary Place/Transition nets suited to model open systems which might interact with the surrounding environment and&nbsp;[&hellip;]

---

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;]

---

Coalgebraic Behavioral Metrics

Paolo Baldan ; Filippo Bonchi ; Henning Kerstan ; Barbara König.

We study different behavioral metrics, such as those arising from both branching and linear-time semantics, in a coalgebraic setting. Given a coalgebra $\alpha\colon X \to HX$ for a functor $H \colon \mathrm{Set}\to \mathrm{Set}$, we define a framework for deriving pseudometrics on $X$ which measure&nbsp;[&hellip;]

---

Fixpoint Theory -- Upside Down

Paolo Baldan ; Richard Eggert ; Barbara König ; Tommaso Padoan.

Knaster-Tarski's theorem, characterising the greatest fixpoint of a monotone function over a complete lattice as the largest post-fixpoint, naturally leads to the so-called coinduction proof principle for showing that some element is below the greatest fixpoint (e.g., for providing bisimilarity&nbsp;[&hellip;]

---

Conditional Bisimilarity for Reactive Systems

Mathias Hülsbusch ; Barbara König ; Sebastian Küpper ; Lara Stoltenow.

Reactive systems \`a la Leifer and Milner, an abstract categorical framework for rewriting, provide a suitable framework for deriving bisimulation congruences. This is done by synthesizing interactions with the environment in order to obtain a compositional semantics. We enrich the notion of&nbsp;[&hellip;]

---