- 5
- 1
Sylvain Schmitz
6
Documents
Présentation
Publications
- 4
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 4
- 6
- 2
Branching in Well-Structured Transition Systems (Invited Talk)29th EACSL Annual Conference on Computer Science Logic (CSL 2021), 2021, Ljubljana, Slovenia. pp.3:1--3:3, ⟨10.4230/LIPIcs.CSL.2021.3⟩
Communication dans un congrès
hal-03439623v1
|
|
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
|
|
Bisimulation Equivalence of First-Order Grammars is ACKERMANN-CompleteLICS 2019, 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2019, Vancouver, Canada. pp.1--12, ⟨10.1109/LICS.2019.8785848⟩
Communication dans un congrès
hal-02267529v1
|
|
Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets13th International Conference on Reachability Problems (RP 2019), 2019, Brussels, Belgium. pp.193--201, ⟨10.1007/978-3-030-30806-3_15⟩
Communication dans un congrès
hal-03440052v1
|
|
|
The Parametric Complexity of Lossy Counter MachinesICALP 2019, Jul 2019, Patras, Greece. pp.129:1--129:15, ⟨10.4230/LIPIcs.ICALP.2019.129⟩
Communication dans un congrès
hal-02020728v2
|