Algorithmic Analysis of Programs with Well Quasi-ordered Domains, Information and Computation, vol.160, issue.1-2, pp.109-127, 2000. ,
DOI : 10.1006/inco.1999.2843
Monotonic and Downward Closed Games, Journal of Logic and Computation, vol.18, issue.1, pp.153-169, 2008. ,
DOI : 10.1093/logcom/exm062
Recursivite et cones rationnels fermes par intersection, Calcolo, vol.18, issue.4, pp.381-39410, 1978. ,
DOI : 10.5802/aif.287
Polynomial automata: Zeroness and applications, LICS 2017, 2017. ,
Handling Infinitely Branching WSTS, ICALP 2014, pp.13-25, 2014. ,
DOI : 10.1007/978-3-662-43951-7_2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.643.9970
On the cardinality of the set of initial intervals of a partially ordered set In Infinite and finite sets: to Paul Erd? os on his 60th birthday, pp.189-198, 1975. ,
Extending the Rackoff technique to affine nets, FSTTCS 2012 of Leibniz Int. Proc. Inf, pp.301-312 ,
Complexity Analysis of the Backward Coverability Algorithm for VASS, RP 2011, pp.96-109 ,
DOI : 10.1007/978-3-642-24288-5_10
Alternating Vector Addition Systems with States, MFCS 2014, pp.220-231, 2014. ,
DOI : 10.1007/978-3-662-44522-8_19
URL : https://hal.archives-ouvertes.fr/hal-00980878
Vector addition tree automata, LICS 2004, pp.64-73, 2004. ,
On Freeze LTL with Ordered Attributes, FoSSaCS 2016, pp.269-284, 2016. ,
DOI : 10.1007/978-3-642-15155-2_54
URL : http://arxiv.org/abs/1504.06355
The covering and boundedness problems for branching vector addition systems, Journal of Computer and System Sciences, vol.79, issue.1, pp.23-38, 2013. ,
DOI : 10.1016/j.jcss.2012.04.002
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.256
Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma, 2011 IEEE 26th Annual Symposium on Logic in Computer Science, pp.269-278 ,
DOI : 10.1109/LICS.2011.39
URL : http://arxiv.org/abs/1007.2989
Forward analysis for WSTS, part I: Completions, STACS 2009 of Leibniz Int. Proc. Inf, pp.433-444 ,
DOI : 10.2168/lmcs-8(3:28)2012
URL : https://hal.archives-ouvertes.fr/inria-00359699
Forward analysis for WSTS, part II: Complete WSTS, Logic. Meth. in Comput. Sci, vol.83, issue.3, pp.28-29, 2012. ,
DOI : 10.2168/lmcs-8(3:28)2012
URL : http://arxiv.org/pdf/1208.4549
Well-structured transition systems everywhere! Theor, Comput. Sci, vol.256, issue.1200, pp.63-9210, 2001. ,
DOI : 10.1016/s0304-3975(00)00102-x
URL : http://doi.org/10.1016/s0304-3975(00)00102-x
On a generalization of a result by Valk and Jantzen, 2009. ,
The ideal approach to computing closed subsets in well-quasi-orderings ,
The power of priority channel systems, Logic. Meth. in Comput. Sci, vol.104, issue.44, pp.1-4, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01091086
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets, 2012 27th Annual IEEE Symposium on Logic in Computer Science, pp.355-364, 2012. ,
DOI : 10.1109/LICS.2012.46
URL : https://hal.archives-ouvertes.fr/hal-00793811
The Parametric Ordinal-Recursive Complexity of Post Embedding Problems, FoSSaCS 2013, pp.273-288, 2013. ,
DOI : 10.1007/978-3-642-37075-5_18
URL : https://hal.archives-ouvertes.fr/hal-00793808
Decidable models of recursive asynchronous concurrency ,
Non-elementary complexities for branching VASS, MELL, and extensions, ACM Trans. Comput. Logic, vol.1620, issue.3, pp.1-30, 2015. ,
The complexity of coverability in ?-petri nets, LICS 2016, pp.467-476, 2016. ,
Nets with tokens which carry data, Fund. Inform, vol.88, issue.3, pp.251-274, 2008. ,
On Functions Weakly Computable by Petri Nets and Vector Addition Systems, Lect. Notes in Comput. Sci, vol.8762, pp.190-202, 2014. ,
DOI : 10.1007/978-3-319-11439-2_15
URL : https://hal.archives-ouvertes.fr/hal-01084971
Decision problems for propositional linear logic, Ann. Pure App. Logic, vol.56, issue.92, pp.1-3239, 1992. ,
DOI : 10.1109/fscs.1990.89588
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.8163
The reachability problem requires exponential space, 1976. ,
Expand, Enlarge, and Check for Branching Vector Addition Systems, Concur 2013, pp.152-166 ,
DOI : 10.1007/978-3-642-40184-8_12
Fine analysis of the quasi-orderings on the power set. Order, pp.339-34710, 2001. ,
The covering and boundedness problems for vector addition systems, Theoretical Computer Science, vol.6, issue.2, pp.223-23110, 1978. ,
DOI : 10.1016/0304-3975(78)90036-1
URL : http://doi.org/10.1016/0304-3975(78)90036-1
Ordinal recursive complexity of unordered data nets Also published as Technical Report TR-4-14, Departamento de Sistemas Informáticos y Computación, 2014. ,
DOI : 10.1016/j.ic.2017.02.002
Decidability and complexity of Petri nets with unordered data, Theoretical Computer Science, vol.412, issue.34, pp.4439-4451, 2011. ,
DOI : 10.1016/j.tcs.2011.05.007
On the computational complexity of dominance links in grammatical formalisms, ACL 2010, pp.514-524, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-00482396
Multiply-Recursive Upper Bounds with Higman?s Lemma, ICALP 2011, pp.441-452 ,
DOI : 10.1006/jsco.1994.1059
URL : http://arxiv.org/abs/1103.4399
Algorithmic aspects of WQO theory. Lecture notes, 2012. URL http://cel.archives-ouvertes ,
URL : https://hal.archives-ouvertes.fr/cel-00727025
Revisiting Ackermann-hardness for lossy counter machines and reset Petri nets, MFCS 2010, pp.616-628, 2010. ,
The complexity of decision procedures in relevance logic II, The Journal of Symbolic Logic, vol.24, issue.04, pp.1774-180210, 1999. ,
DOI : 10.1145/322261.322271
Karp-Miller trees for a branching extension of VASS, Disc. Math. Theor. Comput. Sci, vol.7, issue.1, pp.217-230, 2005. ,
URL : https://hal.archives-ouvertes.fr/hal-00959038