Search

• < Previous
• 1
• Next >

---

Petri Automata

Paul Brunet ; Damien Pous.

Kleene algebra axioms are complete with respect to both language models and binary relation models. In particular, two regular expressions recognise the same language if and only if they are universally equivalent in the model of binary relations. We consider Kleene allegories, i.e., Kleene algebras&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;]

---