40 citations · 108 across the 14 of their papers we have counts for
16 papers
Learning Weighted Automata over Number Rings, Concretely and Categorically
Quentin Aristote, Sam van Gool, Daniela Petrişan +1
We develop a generic reduction procedure for active learning problems. Our approach is inspired by a recent polynomial-time reduction of the exact learning problem for weighted aut…
Correspondences between codensity and coupling-based liftings, a practical approach
Samuel Humeau, Daniela Petrisan, Jurriaan Rot
The Kantorovich distance is a widely used metric between probability distributions. The Kantorovich-Rubinstein duality states that it can be defined in two equivalent ways: as a su…
Semialgebras and Weak Distributive Laws
Daniela Petrişan, Ralph Sarkis
Motivated by recent work on weak distributive laws and their applications to coalgebraic semantics, we investigate the algebraic nature of semialgebras for a monad. These are algeb…
Learning automata and transducers: a categorical approach
Thomas Colcombet, Daniela Petrişan, Riccardo Stabile
In this paper, we present a categorical approach to learning automata over words, in the sense of the -algorithm of Angluin. This yields a new generic -like algorithm whi…
Combining Weak Distributive Laws: Application to Up-To Techniques
Alexandre Goy, Daniela Petrisan
The coalgebraic modelling of alternating automata and of probabilistic automata has long been obstructed by the absence of distributive laws of the powerset monad over itself, resp…
Up-To Techniques for Behavioural Metrics via Fibrations
Filippo Bonchi, Barbara König, Daniela Petrisan
Up-to techniques are a well-known method for enhancing coinductive proofs of behavioural equivalences. We introduce up-to techniques for behavioural metrics between systems modelle…