Algorithmic analysis of programs with well quasi-ordered domains, Information and Computation, vol.160, issue.1-2, pp.109-127, 2000. ,
Verifying programs with unreliable channels. Information and Computation, vol.127, pp.91-101, 1996. ,
Linearizing well-quasi orders and bounding the length of bad sequences, Theoretical Computer Science, vol.603, pp.3-22, 2015. ,
On decidability of the control reachability problem in the asynchronous ?-calculus, Nordic Journal of Computing, vol.9, issue.2, pp.70-101, 2002. ,
Récursivité et cones rationnels fermés par intersection, CALCOLO, vol.15, issue.4, pp.381-394, 1978. ,
The ordinal recursive complexity of lossy channel systems, Proceedings of LICS 2008, pp.205-216, 2008. ,
Ordinal recursive bounds for Higman's Theorem, Theoretical Computer Science, vol.201, issue.1-2, pp.63-84, 1998. ,
On the finite containment problem for Petri nets, Theoretical Computer Science, vol.43, issue.86, pp.90169-90175, 1986. ,
Well-partial orderings and hierarchies, Indagationes Mathematicae, vol.39, issue.3, pp.90067-90068, 1977. ,
On freeze LTL with ordered attributes, Proceedings of FoSSaCS, vol.9634, pp.269-284, 2016. ,
LTL with the freeze quantifier and register automata, ACM Transactions on Computational Logic, vol.10, issue.3, 2009. ,
Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors, American Journal of Mathematics, vol.35, issue.4, pp.413-422, 1913. ,
On ordinal invariants in well quasi orders and finite antichain orders, Well-Quasi Orders in Computation, Logic, Language and Reasoning, 2019. ,
Hierarchies of provably recursive functions, Handbook of Proof Theory, vol.137, pp.80018-80027, 1998. ,
Ackermannian and primitive-recursive bounds with Dickson's Lemma, Proceedings of LICS 2011, pp.269-278, 2011. ,
Future-looking logics on data words and trees, Proceedings of MFCS 2009, vol.5734, pp.331-343, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-01806188
Well-structured transition systems everywhere! Theoretical Computer Science, vol.256, pp.63-92, 2001. ,
History-register automata, Logical Methods in Computer Science, vol.12, issue.1, 2016. ,
The power of priority channel systems, Logical Methods in Computer Science, vol.10, issue.4, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-00793809
The ordinal recursive complexity of timed-arc Petri nets, data nets, and other enriched nets, Proceedings of LICS 2012, pp.355-364, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00793811
Senescent ground tree rewriting systems, Proceedings of CSL-LICS 2014, vol.48, pp.1-48, 2014. ,
Ordering by divisibility in abstract algebras, Proceedings of the London Mathematical Society, vol.3, issue.2, pp.326-336, 1952. ,
Trace inclusion for one-counter nets revisited, Theoretical Computer Science, vol.735, pp.50-63, 2018. ,
Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states, Theoretical Computer Science, vol.46, issue.86, pp.90026-90031, 1986. ,
Bisimulation equivalence of first-order grammars is ACKERMANN-complete, Proceedings of LICS 2019, 2019. ,
The parametric ordinal-recursive complexity of Post embedding problems, Proceedings of FoSSaCS 2013, vol.7794, pp.273-288, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00793808
The theory of well-quasi-ordering: A frequently discovered concept, Journal of Combinatorial Theory, Series A, vol.13, issue.3, pp.90063-90068, 1972. ,
Safety metric temporal logic is ACKERMANN-complete, ACM Transactions on Computational Logic, vol.17, issue.3, 2016. ,
Non-elementary complexities for branching VASS, MELL, and extensions, ACM Transactions on Computational Logic, vol.16, issue.3, 2015. ,
The complexity of coverability in ?-Petri nets, Proceedings of LICS 2016, pp.467-476, 2016. ,
Hierarchies of number theoretic functions, I. Archiv für Mathematische Logik und Grundlagenforschung, vol.13, pp.39-51, 1970. ,
The complexity of the finite containment problem for Petri nets, Journal of the ACM, vol.28, issue.3, pp.561-576, 1981. ,
Undecidable problems in unreliable computations, Theoretical Computer Science, vol.297, issue.1-3, pp.337-354, 2003. ,
Petri nets and large finite sets, Theoretical Computer Science, vol.32, issue.1-2, pp.173-183, 1984. ,
Handbook of Theoretical Computer Science, volume B, chapter 19, pp.1201-1242, 1990. ,
Maximal decidable fragments of Halpern and Shoham's modal logic of intervals, Proceedings of ICALP 2010, vol.6199, pp.345-356, 2010. ,
The fixed initial credit problem for partial-observation energy games is ACKcomplete, Information Processing Letters, vol.118, pp.91-99, 2017. ,
Ordinal recursive complexity of unordered data nets. Information and Computation, vol.254, pp.41-58, 2017. ,
, Complexity hierarchies beyond ELEMENTARY. ACM Transactions on Computation Theory, vol.8, issue.1, 2016.
Algorithmic Complexity of Well-Quasi-Orders. Habilitation thesis, École Normale Supérieure Paris-Saclay, 2017. tel.archives-ouvertes.fr, p.1663266 ,
URL : https://hal.archives-ouvertes.fr/tel-01663266
Multiply-recursive upper bounds with Higman's Lemma, Proceedings of ICALP 2011, vol.6756, pp.441-452, 2011. ,
Algorithmic aspects of wqo theory. Lecture notes, 2012. cel.archives-ouvertes ,
URL : https://hal.archives-ouvertes.fr/cel-00727025
The power of well-structured systems, Proceedings of Concur, vol.8052, pp.5-24, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00907964
Verifying lossy channel systems has nonprimitive recursive complexity, Information Processing Letters, vol.83, issue.5, pp.251-261, 2002. ,
Lossy counter machines decidability cheat sheet, Proceedings of RP 2010, vol.6227, pp.51-75, 2010. ,
Revisiting Ackermann-hardness for lossy counter machines and reset Petri nets, Proceedings of MFCS 2010, vol.6281, pp.616-628, 2010. ,
Proofs and Computation. Perspectives in Logic, 2012. ,
The complexity of decision procedures in relevance logic II, Journal of Symbolic Logic, vol.64, issue.4, pp.1774-1802, 1999. ,
Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy, Journal of Symbolic Logic, vol.37, issue.2, pp.281-292, 1972. ,
Complexity bounds for some finite forms of Kruskal's Theorem, Journal of Symbolic Computation, vol.18, issue.5, pp.463-488, 1994. ,