| A well-structured framework for analysing Petri net extensions A Finkel, P McKenzie, C Picaronny Information and Computation 195 (1-2), 1-29, 2004 | 73 | 2004 |
| Probabilistic model checking of the CSMA/CD protocol using PRISM and APMC M Duflot, L Fribourg, T Herault, R Lassaigne, F Magniette, S Messika, ... Electronic Notes in Theoretical Computer Science 128 (6), 195-214, 2005 | 70 | 2005 |
| Coupling and importance sampling for statistical model checking B Barbot, S Haddad, C Picaronny Tools and Algorithms for the Construction and Analysis of Systems: 18th …, 2012 | 56 | 2012 |
| Practical applications of probabilistic model checking to communication protocols M Duflot, M Kwiatkowska, G Norman, D Parker, S Peyronnet, C Picaronny, ... Formal Methods for Industrial Critical Systems: A Survey of Applications …, 2012 | 54 | 2012 |
| Randomized dining philosophers without fairness assumption M Duflot, L Fribourg, C Picaronny Distributed Computing 17 (1), 65-76, 2004 | 37 | 2004 |
| Types of blocks with dihedral or quaternion defect groups M Cabanes, C Picaronny Journal of the Faculty of Science, the University of Tokyo. Sect. 1 A …, 1992 | 29 | 1992 |
| Randomized finite-state distributed algorithms as Markov chains M Duflot, L Fribourg, C Picaronny Distributed Computing: 15th International Conference, DISC 2001 Lisbon …, 2001 | 28 | 2001 |
| Coupling and self-stabilization L Fribourg, S Messika, C Picaronny DISC, 201-215, 2004 | 19 | 2004 |
| Accepting Zeno words: a way toward timed refinements B Bérard, C Picaronny Acta Informatica 37, 45-81, 2000 | 17 | 2000 |
| Quelques remarques sur un thème de Knörr C Picaronny, L Puig Journal of Algebra 109 (1), 69-73, 1987 | 17 | 1987 |
| Computing expected absorption times for parametric determinate probabilistic timed automata N Chamseddine, M Duflot, L Fribourg, C Picaronny, J Sproston 2008 Fifth International Conference on Quantitative Evaluation of Systems …, 2008 | 10 | 2008 |
| Accepting Zeno words without making time stand still B Bérard, C Picaronny Mathematical Foundations of Computer Science 1997: 22nd International …, 1997 | 9 | 1997 |
| Importance sampling for model checking of continuous time markov chains B Barbot, S Haddad, C Picaronny SIMUL, 30-35, 2012 | 8 | 2012 |
| Polynomial interrupt timed automata B Bérard, S Haddad, C Picaronny, MS El Din, M Sassolas Reachability Problems: 9th International Workshop, RP 2015, Warsaw, Poland …, 2015 | 7 | 2015 |
| Rare event handling in signalling cascades B Barbot, S Haddad, M Heiner, C Picaronny Int. J. Adv. Syst. Meas 8 (1-2), 69-79, 2015 | 4 | 2015 |
| A well-structured framework for analysing Petri nets extensions A Finkel, P McKenzie, C Picaronny INFORMATION AND COMPUTATION, 1999 | 4 | 1999 |
| Determinate probabilistic timed automata as Markov chains with parametric costs N Chamseddine, M Duflot, L Fribourg, C Picaronny Technical Report LSV-07-21, Laboratory Specification and Verification, 2007 | 3 | 2007 |
| Échantillonnage préférentiel pour le model checking statistique B Barbot, S Haddad, C Picaronny Journal européen des systèmes automatisés 45 (1-3), 237-252, 2011 | 2 | 2011 |
| Accepting zeno words without stopping time B Bérard, C Picaronny Proceedings of the 22th International Symposium MFCS'97, 148-158, 1997 | 2 | 1997 |
| Trace of Randomized distributed algorithms as Gibbs fields L Fribourg, S Messika, C Picaronny Research Report LSV-02-12, September 2002, Lab. Spéc. et. Vér, CNRS & ENS de …, 0 | 2 | |
Laurent FRIBOURGLMF - ENS Paris-Saclay & CNRSAdresse e-mail validée de lsv.fr
