activity
20172020
most citedOn Reversible Transducers

1 citations · 2 across the 4 of their papers we have counts for

collaborators

6 papers

cs.SE2020

The CLEARSY Safety Platform: 5 Years of Research, Development and Deployment

Thierry Lecomte, David Deharbe, Paulin Fournier +1

The CLEARSY Safety Platform (CSSP) was designed to ease the development of safety critical systems and to reduce the overall costs (development, deployment, and certification) unde…

cs.FL20191 cited

Equivalence kernels of sequential functions and sequential observation synthesis

Paulin Fournier, Nathan Lhote

We show that one can decide if a rational equivalence relation can be given as the equivalence kernel of a sequential letter-to-letter transduction. This problem comes from the set…

cs.LO2018

Parametric Timed Broadcast Protocols

Étienne André, Benoît Delahaye, Paulin Fournier +1

In this paper we consider state reachability in networks composed of many identical processes running a parametric timed broadcast protocol (PTBP). PTBP are a new model extending b…

cs.LO2018

Alternating Nonzero Automata

Paulin Fournier, Hugo Gimbert

We introduce a new class of automata on infinite trees called \emph{alternating nonzero automata}, which extends the class of non-deterministic nonzero automata. We reduce the empt…

cs.LO2017

Reachability in Parametric Interval Markov Chains using Constraints

Anicet Bart, Benoit Delahaye, Didier Lime +2

Parametric Interval Markov Chains (pIMCs) are a specification formalism that extend Markov Chains (MCs) and Interval Markov Chains (IMCs) by taking into account imprecision in the…

cs.FL20171 cited

On Reversible Transducers

Luc Dartois, Paulin Fournier, Ismaël Jecker +1

Deterministic two-way transducers define the robust class of regular functions which is, among other good properties, closed under composition. However, the best known algorithms f…