- 4
- 1
Sylvain Schmitz
5
Documents
Présentation
Publications
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 5
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 3
- 2
- 1
Reachability in Vector Addition Systems is Primitive-Recursive in Fixed DimensionLICS 2019, 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2019, Vancouver, Canada. pp.1--13, ⟨10.1109/LICS.2019.8785796⟩
Communication dans un congrès
hal-02267524v1
|
|
Ideal Decompositions for Vector Addition SystemsSTACS 2016 - 33rd Symposium on Theoretical Aspects of Computer Science, 2016, Orléans, France. pp.1--13, ⟨10.4230/LIPIcs.STACS.2016.1⟩
Communication dans un congrès
hal-01275991v1
|
|
|
Coverability Trees for Petri Nets with Unordered DataFoSSaCS, 2016, Eindhoven, Netherlands. pp.445--461, ⟨10.1007/978-3-662-49630-5_26⟩
Communication dans un congrès
hal-01252674v1
|
Demystifying Reachability in Vector Addition SystemsLICS 2015, Jul 2015, Kyoto, Japan. pp.56--67, ⟨10.1109/LICS.2015.16⟩
Communication dans un congrès
hal-01168388v1
|