Edit Profile Blondin, Michael Compute Distance To: Compute Author ID: blondin.michael Published as: Blondin, Michael Documents Indexed: 15 Publications since 2012 all top 5 Co-Authors 0 single-authored 8 Finkel, Alain 6 McKenzie, Pierre 4 Haase, Christoph 3 Esparza, Javier 3 Jaax, Stefan 2 Goubault-Larrecq, Jean 2 Haddad, Serge 1 Göller, Stefan 1 Krebs, Andreas 1 Kucera, Antonin 1 Meyer, Philipp J. 1 Raskin, Mikhail Serials 2 Logical Methods in Computer Science 1 Information and Computation 1 Computational Complexity 1 ACM Transactions on Computational Logic Fields 15 Computer science (68-XX) 2 Mathematical logic and foundations (03-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH 7 Publications have been cited 16 times in 13 Documents Cited by ▼ Year ▼ Reachability in two-dimensional vector addition systems with states is PSPACE-complete. Zbl 1401.68095Blondin, Michael; Finkel, Alain; Goller, Stefan; Haase, Christoph; McKenzie, Pierre 7 2015 Well behaved transition systems. Zbl 06790161Blondin, Michael; Finkel, Alain; McKenzie, Pierre 3 2017 Handling infinitely branching well-structured transition systems. Zbl 1383.68054Blondin, Michael; Finkel, Alain; McKenzie, Pierre 2 2018 Forward analysis for WSTS. Part III: Karp-Miller trees. Zbl 07278088Blondin, Michael; Finkel, Alain; Goubault-Larrecq, Jean 1 2018 Towards efficient verification of population protocols. Zbl 1380.68037Blondin, Michael; Esparza, Javier; Jaax, Stefan; Meyer, Philipp J. 1 2017 Handling infinitely branching WSTS. Zbl 1382.68149Blondin, Michael; Finkel, Alain; McKenzie, Pierre 1 2014 The complexity of intersecting finite automata having few final states. Zbl 1360.68495Blondin, Michael; McKenzie, Pierre 1 2012 Handling infinitely branching well-structured transition systems. Zbl 1383.68054Blondin, Michael; Finkel, Alain; McKenzie, Pierre 2 2018 Forward analysis for WSTS. Part III: Karp-Miller trees. Zbl 07278088Blondin, Michael; Finkel, Alain; Goubault-Larrecq, Jean 1 2018 Well behaved transition systems. Zbl 06790161Blondin, Michael; Finkel, Alain; McKenzie, Pierre 3 2017 Towards efficient verification of population protocols. Zbl 1380.68037Blondin, Michael; Esparza, Javier; Jaax, Stefan; Meyer, Philipp J. 1 2017 Reachability in two-dimensional vector addition systems with states is PSPACE-complete. Zbl 1401.68095Blondin, Michael; Finkel, Alain; Goller, Stefan; Haase, Christoph; McKenzie, Pierre 7 2015 Handling infinitely branching WSTS. Zbl 1382.68149Blondin, Michael; Finkel, Alain; McKenzie, Pierre 1 2014 The complexity of intersecting finite automata having few final states. Zbl 1360.68495Blondin, Michael; McKenzie, Pierre 1 2012 all cited Publications top 5 cited Publications all top 5 Cited by 28 Authors 4 Finkel, Alain 4 Goubault-Larrecq, Jean 3 Blondin, Michael 2 Totzke, Patrick 1 Alechina, Natasha 1 Bulling, Nils 1 Chambart, Pierre 1 Czerwiński, Wojciech 1 Demri, Stéphane P. 1 Esparza, Javier 1 Halfon, Simon 1 Hofman, Piotr 1 Karandikar, Prateek 1 Krebs, Andreas 1 Kumar, K. Narayan 1 Lasota, Sławomir 1 Leroux, Jérôme 1 Logan, Brian 1 McKenzie, Pierre 1 Michaliszyn, Jakub 1 Niskanen, Reino 1 Otop, Jan 1 Potapov, Igor 1 Reichert, Julien 1 Schmitz, Sylvain 1 Schnoebelen, Philippe 1 Sutre, Grégoire 1 Wieczorek, Piotr Cited in 5 Serials 3 Theoretical Computer Science 2 Logical Methods in Computer Science 1 Journal of Computer and System Sciences 1 MSCS. Mathematical Structures in Computer Science 1 Computational Complexity Cited in 3 Fields 13 Computer science (68-XX) 3 Mathematical logic and foundations (03-XX) 1 Game theory, economics, finance, and other social and behavioral sciences (91-XX) Citations by Year