Selected publications by Claudine Picaronny
Journals
-
L. Fribourg, S. Messika and C. Picaronny. Coupling and Self-Stabilization. Distributed Computing 18(3), pages 221-232, 2006. ( PDF | PS | PS.GZ | BibTeX + Abstract )
-
A. Finkel, P. McKenzie and C. Picaronny. A Well-Structured Framework for Analysing Petri Net Extensions. Information and Computation 195(1-2), pages 1-29, 2004. ( PS | PS.GZ | BibTeX )
-
M. Duflot, L. Fribourg and C. Picaronny. Randomized Dining Philosophers Without Fairness Assumption. Distributed Computing 17(1), pages 65-76, 2004. ( PS | PS.GZ | BibTeX )
-
B. Bérard and C. Picaronny. Accepting Zeno Words: A Way Toward Timed Refinements. Acta Informatica 37(1), pages 45-81, 2000. ( PS | PS.GZ | BibTeX )
Conferences
-
B. Barbot, S. Haddad and C. Picaronny. Coupling and Importance Sampling for Statistical Model Checking. In TACAS'12, LNCS. Springer, 2012. To appear. ( PDF (long version) | BibTeX )
-
B. Barbot, S. Haddad and C. Picaronny. Échantillonnage préférentiel pour le model checking
statistique. In MSR'11, Journal Européen des Systèmes Automatisés 45(1-3), pages 237-252. Hermès, 2011. ( PDF | PDF (long version) | BibTeX + Abstract )
-
N. Chamseddine, M. Duflot, L. Fribourg, C. Picaronny and J. Sproston. Computing Expected Absorption Times for Parametric Determinate
Probabilistic Timed Automata. In QEST'08, pages 254-263. IEEE Computer Society Press, 2008. ( PDF | PDF (long version) | BibTeX + Abstract )
-
M. Duflot, L. Fribourg, Th. Hérault, R. Lassaigne, F. Magniette, S. Messika, S. Peyronnet and C. Picaronny. Probabilistic Model Checking of the CSMA/CD Protocol Using PRISM
and APMC. In AVoCS'04, ENTCS 128(6), pages 195-214. Elsevier Science Publishers, 2005. ( PDF | BibTeX )
-
L. Fribourg, S. Messika and C. Picaronny. Coupling and Self-Stabilization. In DISC'04, LNCS 3274, pages 201-215. Springer, 2004. ( PDF | BibTeX )
-
M. Duflot, L. Fribourg and C. Picaronny. Randomized Dining Philosophers without Fairness Assumption. In IFIP TCS'02, IFIP Conference Proceedings 223, pages 169-180. Kluwer Academic Publishers, 2002. ( PS | PS.GZ | BibTeX )
-
M. Duflot, L. Fribourg and C. Picaronny. Randomized Finite-State Distributed Algorithms as Markov Chains. In DISC'01, LNCS 2180, pages 240-254. Springer, 2001. ( PS | PS.GZ | BibTeX )
-
B. Bérard and C. Picaronny. Accepting Zeno Words without Making Time Stand Still. In MFCS'97, LNCS 1295, pages 149-158. Springer, 1997. ( PS | PS.GZ | BibTeX )
Other Publications
-
N. Chamseddine, M. Duflot, L. Fribourg and C. Picaronny. Determinate Probabilistic Timed Automata as Markov Chains with
Parametric Costs. Research Report LSV-07-21, Laboratoire Spécification et Vérification, ENS Cachan,
France, May 2007. 17 pages. ( PDF | BibTeX + Abstract )
-
L. Fribourg, C. Picaronny and S. Pinot. Manipulation de backoff dans CSMA/CA. Contract Report (Lot 4.2 fourniture 6), projet RNTL Averroes, March 2006. 20 pages. ( PDF | BibTeX )
-
L. Fribourg, S. Messika and C. Picaronny. Parametric and Probabilistic Verification of
Nicollin-Sifakis-Yovine's Model of the CSMA/CD Protocol. Contract Report (Lot 4.2 fourniture 3), projet RNTL Averroes, June 2004. 17 pages. ( PS | PS.GZ | BibTeX )
-
L. Fribourg, S. Messika and C. Picaronny. Mixing Time of the Asymmetric Simple Exclusion Problem on a Ring with
Two Particles. Research Report LSV-04-12, Laboratoire Spécification et Vérification, ENS Cachan,
France, June 2004. 15 pages. ( PS | PS.GZ | BibTeX )
-
M. Duflot, S. Messika and C. Picaronny. Vérification du protocole CSMA/Cd sous PRISM. Contract Report (Lot 4.2 fourniture 1), projet RNTL Averroes, January 2004. 12 pages. ( PS | PS.GZ | BibTeX )
-
L. Fribourg, S. Messika and C. Picaronny. Traces of Randomized Distributed Algorithms As Markov Fields.
Application to Rapid Mixing. Research Report LSV-03-10, Laboratoire Spécification et Vérification, ENS Cachan,
France, July 2003. 19 pages. ( PS | PS.GZ | BibTeX )
-
L. Fribourg, S. Messika and C. Picaronny. On the Absence of Phase Transition in Randomized Distributed
Algorithms. Research Report LSV-03-7, Laboratoire Spécification et Vérification, ENS Cachan,
France, April 2003. 17 pages. ( PS | PS.GZ | BibTeX )
-
L. Fribourg, S. Messika and C. Picaronny. Traces of Randomized Distributed Algorithms as Gibbs Fields. Research Report LSV-02-12, Laboratoire Spécification et Vérification, ENS Cachan,
France, September 2002. 16 pages. ( PS | PS.GZ | BibTeX )
-
A. Finkel, P. McKenzie and C. Picaronny. A Well-Structured Framework for Analysing Petri Net Extensions. Research Report LSV-99-2, Laboratoire Spécification et Vérification, ENS Cachan,
France, February 1999. ( PS | PS.GZ | BibTeX )
-
A. Finkel, P. McKenzie and C. Picaronny. Minimal Coverability Trees for High Level Nets. Internal Report 96-3, Laboratoire d'Informatique Fondamentale et Appliquée de Cachan,
ENS Cachan, France, March 1996. ( BibTeX )