Uniform generation in trace monoids, MFCS 2015, vol.9234, pp.63-75, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01328454
Computational Complexity -A Modern Approach, 2009. ,
Rectangular Young tableaux with local decreases and the density method for uniform random generation (short version), 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01795882
Uniform sampling for networks of automata, vol.85, pp.1-36, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01545936
, Combinatorial Species and Tree-like Structures. Encyclopedia of Mathematics and its Applications, 1998.
Increasing diamonds, LATIN 2016: Theoretical Informatics -12th Latin American Symposium, vol.9644, pp.207-219, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01331227
Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets, 12th International Computer Science Symposium in Russia (CSR), pp.71-84, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01476189
The Ordered and Colored Products in Analytic Combinatorics: Application to the Quantitative Study of Synchronizations in Concurrent Processes, 14th SIAM Meeting on Analytic Algorithmics and Combinatorics (ANALCO), pp.16-30, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01448695
The combinatorics of barrier synchronization, Proceedings of the 40th International Conference on Application and Theory of Petri Nets and Concurrency, PETRI NETS 2019, pp.386-405, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02163607
Beyond series-parallel concurrent systems: The case of arch processes, Analysis of Algorithms, vol.110, pp.1-14, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-02073611
The combinatorics of non-determinism, FSTTCS'13, vol.24, pp.425-436, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-01216553
A Quantitative Study of Pure Parallel Processes, Electronic Journal of Combinatorics, vol.23, issue.1, p.39, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01284220
Counting linear extensions is #P-complete, STOC, pp.175-181, 1991. ,
Decidability issues for petri nets -a survey, J. Inf. Process. Cybern, vol.30, issue.3, pp.143-160, 1994. ,
Analytic Combinatorics, 2009. ,
URL : https://hal.archives-ouvertes.fr/inria-00072739
A calculus for the random generation of labelled combinatorial structures, Theor. Comput. Sci, vol.132, issue.2, pp.1-35, 1994. ,
Direct bulk-synchronous parallel algorithms, J. Parallel Distrib. Comput, vol.22, issue.2, pp.251-267, 1994. ,
Monte Carlo model checking, TACAS'05, vol.3440, pp.271-286, 2005. ,
Two algorithms for barrier synchronization, International Journal of Parallel Programming, vol.17, issue.1, pp.1-17, 1988. ,
Fast perfect sampling from linear extensions, Discrete Mathematics, vol.306, issue.4, pp.420-428, 2006. ,
Promises: Linguistic support for efficient asynchronous procedure calls in distributed systems, PLDI'88, pp.260-267, 1988. ,
Computationally Tractable Classes of Ordered Sets, 1987. ,
Uniform Monte-Carlo model checking, FASE 2011, vol.6603, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00644834
, Algorithms and Order. NATO Science Series, 1988.
Effective random testing of concurrent programs, Automated Software Engineering ASE'07, pp.323-332, 2007. ,
Two poset polytopes, Discrete & Computational Geometry, vol.1, pp.9-23, 1986. ,
, The Sage Developers. SageMath, the Sage Mathematics Software System (Version 8.5.0), 2018.
A bridging model for multi-core computing, Journal of Computer and System Sciences, vol.77, issue.1, pp.154-166, 2011. ,