| No. |
Title |
Author |
Year |
| 1 |
A Unifying Framework for Deciding Synchronizability |
Bollig, Benedikt et al. |
2021 |
| 2 |
Bounded Reachability Problems Are Decidable in FIFO Machines |
Bollig, Benedikt et al. |
2020 |
| 3 |
The Well Structured Problem for Presburger Counter Machines |
Finkel, Alain et al. |
2019 |
| 4 |
Verification of Flat FIFO Systems |
Finkel, Alain et al. |
2019 |
| 5 |
Forward Analysis for WSTS, Part III: Karp-Miller Trees |
Blondin, Michael et al. |
2018 |
| 6 |
Reachability for Two-Counter Machines with One Test and One Reset |
Finkel, Alain et al. |
2018 |
| 7 |
Synchronizability of Communicating Finite State Machines is not Decidable |
Finkel, Alain et al. |
2017 |
| 8 |
Reachability Problems for Infinite-State Systems (Dagstuhl Seminar 14141) |
Esparza, Javier et al. |
2014 |
| 9 |
Extending the Rackoff technique to Affine nets |
Bonnet, Rémi et al. |
2012 |
| 10 |
Place-Boundedness for Vector Addition Systems with one zero-test |
Bonnet, Rémi et al. |
2010 |
| 11 |
Forward Analysis for WSTS, Part I: Completions |
Finkel, Alain et al. |
2009 |
