Search

• < Previous
• 1
• Next >

---

Coalgebraic trace semantics via forgetful logics

Bartek Klin ; Jurriaan Rot.

We use modal logic as a framework for coalgebraic trace semantics, and show the flexibility of the approach with concrete examples such as the language semantics of weighted, alternating and tree automata, and the trace semantics of generative probabilistic systems. We provide a sufficient condition&nbsp;[&hellip;]

---

Companions, Causality and Codensity

Damien Pous ; Jurriaan Rot.

In the context of abstract coinduction in complete lattices, the notion of compatible function makes it possible to introduce enhancements of the coinduction proof principle. The largest compatible function, called the companion, subsumes most enhancements and has been proved to enjoy many good&nbsp;[&hellip;]

---