Accepting Zeno Words Without Making Time Stand Still. - Béatrice Bérard; Claudine Picaronny (MFCS, 1997)

Accepting Zeno words: a way toward timed refinements. - Béatrice Bérard; Claudine Picaronny (Acta Informatica, 2000)

Randomized Finite-State Distributed Algorithms as Markov Chains. - Marie Duflot; Laurent Fribourg; Claudine Picaronny (DISC, 2001)

Randomized dining philosophers without fairness assumption. - Marie Duflot; Laurent Fribourg; Claudine Picaronny (Distributed Comput., 2004)

Probabilistic Model Checking of the CSMA/CD Protocol Using PRISM and APMC. - Marie Duflot; Laurent Fribourg; Thomas Hérault; Richard Lassaigne; Frédéric Magniette; Stéphane Messika; Sylvain Peyronnet; Claudine Picaronny (AVoCS, 2004)

A well-structured framework for analysing petri net extensions. - Alain Finkel; Pierre McKenzie; Claudine Picaronny (Inf. Comput., 2004)

Coupling and self-stabilization. - Laurent Fribourg; Stéphane Messika; Claudine Picaronny (Distributed Comput., 2006)

Computing Expected Absorption Times for Parametric Determinate Probabilistic Timed Automata. - Najla Chamseddine; Marie Duflot; Laurent Fribourg; Claudine Picaronny; Jeremy Sproston (QEST, 2008)

Coupling and Importance Sampling for Statistical Model Checking. - Benoît Barbot; Serge Haddad; Claudine Picaronny (TACAS, 2012)

Polynomial Interrupt Timed Automata. - Béatrice Bérard; Serge Haddad; Claudine Picaronny; Mohab Safey El Din; Mathieu Sassolas (RP, 2015)

Polynomial interrupt timed automata: Verification and expressiveness. - Béatrice Bérard; Serge Haddad; Claudine Picaronny; Mohab Safey El Din; Mathieu Sassolas (Inf. Comput., 2021)