| No. |
Title |
Author |
Year |
| 1 |
Front Matter, Table of Contents, Preface, Conference Organization |
Leroux, Jérôme et al. |
2023 |
| 2 |
LIPIcs, Volume 272, MFCS 2023, Complete Volume |
Leroux, Jérôme et al. |
2023 |
| 3 |
The Semilinear Home-Space Problem Is Ackermann-Complete for Petri Nets |
Jančar, Petr et al. |
2023 |
| 4 |
Reachability in Fixed Dimension Vector Addition Systems with States |
Czerwiński, Wojciech et al. |
2020 |
| 5 |
Reachability in Two-Dimensional Vector Addition Systems with States: One Test Is for Free |
Leroux, Jérôme et al. |
2020 |
| 6 |
Distance Between Mutually Reachable Petri Net Configurations |
Leroux, Jérôme |
2019 |
| 7 |
Petri Net Reachability Problem (Invited Talk) |
Leroux, Jérôme |
2019 |
| 8 |
Polynomial Vector Addition Systems With States |
Leroux, Jérôme |
2018 |
| 9 |
Reachability for Two-Counter Machines with One Test and One Reset |
Finkel, Alain et al. |
2018 |
| 10 |
Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One |
Figueira, Diego et al. |
2017 |
| 11 |
Ideal Decompositions for Vector Addition Systems (Invited Talk) |
Leroux, Jérôme et al. |
2016 |
| 12 |
Model Checking Population Protocols |
Esparza, Javier et al. |
2016 |
| 13 |
Verification of Population Protocols |
Esparza, Javier et al. |
2015 |
| 14 |
Place-Boundedness for Vector Addition Systems with one zero-test |
Bonnet, Rémi et al. |
2010 |
| 15 |
Flat counter automata almost everywhere! |
Leroux, Jérôme et al. |
2006 |
