| Reachability in two-dimensional vector addition systems with states is PSPACE-complete M Blondin, A Finkel, S Göller, C Haase, P McKenzie LICS – Logic in Computer Science, 32–43, 2015 | 56 | 2015 |
| Approaching the Coverability Problem Continuously M Blondin, A Finkel, C Haase, S Haddad TACAS – Tools and Algorithms for the Construction and Analysis of Systems …, 2016 | 29 | 2016 |
| Handling infinitely branching WSTS M Blondin, A Finkel, P McKenzie ICALP – Automata, Languages, and Programming, 13–25, 2014 | 18 | 2014 |
| Well Behaved Transition Systems P McKenzie, A Finkel, M Blondin LMCS – Logical Methods in Computer Science 13 (3), 2017 | 17* | 2017 |
| The Logical View on Continuous Petri Nets M Blondin, A Finkel, C Haase, S Haddad TOCL – ACM Transactions on Computational Logic 18 (3), 2017 | 13 | 2017 |
| Affine Extensions of Integer Vector Addition Systems with States M Blondin, C Haase, F Mazowiecki CONCUR – International Conference on Concurrency Theory, 2018 | 12 | 2018 |
| Large Flocks of Small Birds: On the Minimal Size of Population Protocols M Blondin, J Esparza, S Jaax STACS – Symposium on Theoretical Aspects of Computer Science, 16:1–16:14, 2018 | 12 | 2018 |
| Towards Efficient Verification of Population Protocols M Blondin, S Jaax, J Esparza, PJ Meyer PODC – Principles of Distributed Computing, 2017 | 12 | 2017 |
| Forward Analysis for WSTS, Part III: Karp-Miller Trees M Blondin, A Finkel, J Goubault-Larrecq LMCS – Logical Methods in Computer Science 16 (2), 2020 | 10 | 2020 |
| Peregrine: A Tool for the Analysis of Population Protocols M Blondin, J Esparza, S Jaax CAV – Computer Aided Verification, 2018 | 10 | 2018 |
| Forward Analysis for WSTS, Part III: Karp-Miller Trees M Blondin, A Finkel, J Goubault-Larrecq FSTTCS – Foundations of Software Technology and Theoretical Computer Science …, 2017 | 10 | 2017 |
| Handling Infinitely Branching Well-structured Transition Systems M Blondin, A Finkel, P McKenzie Information and Computation 258, 28–49, 2018 | 9 | 2018 |
| The Complexity of Intersecting Finite Automata Having Few Final States M Blondin, A Krebs, P McKenzie Computational Complexity 25 (4), 775–814, 2016 | 9 | 2016 |
| The Complexity of Intersecting Finite Automata Having Few Final States M Blondin, P McKenzie CSR – Computer Science Symposium in Russia, 31–42, 2012 | 9* | 2012 |
| Automatic Analysis of Expected Termination Time for Population Protocols M Blondin, J Esparza, A Kučera CONCUR – International Conference on Concurrency Theory, 2018 | 8 | 2018 |
| Logics for Continuous Reachability in Petri Nets and Vector Addition Systems with States M Blondin, C Haase LICS – Logic in Computer Science, 2017 | 8 | 2017 |
| Expressive Power of Broadcast Consensus Protocols M Blondin, J Esparza, S Jaax CONCUR – International Conference on Concurrency Theory, 2019 | 5 | 2019 |
| Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling M Blondin, J Esparza, M Helfrich, A Kučera, PJ Meyer CAV – International Conference on Computer-Aided Verification, 2020 | 4 | 2020 |
| Succinct Population Protocols for Presburger Arithmetic M Blondin, J Esparza, B Genest, M Helfrich, S Jaax STACS – International Symposium on Theoretical Aspects of Computer Science, 2020 | 4 | 2020 |
| Black Ninjas in the Dark: Formal Analysis of Population Protocols M Blondin, J Esparza, S Jaax, A Kučera LICS – Logic in Computer Science, 2018 | 3 | 2018 |
Alain FinkelLSV ENS Paris SaclayVerified email at lsv.fr
