팔로우
Michael Blondin
제목
인용
인용
연도
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
752015
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
472016
The Logical View on Continuous Petri Nets
M Blondin, A Finkel, C Haase, S Haddad
TOCL – ACM Transactions on Computational Logic 18 (3), 2017
282017
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
272018
Affine Extensions of Integer Vector Addition Systems with States
M Blondin, C Haase, F Mazowiecki, M Raskin
LMCS – Logical Methods in Computer Science 17 (3), 2021
242021
Well Behaved Transition Systems
P McKenzie, A Finkel, M Blondin
LMCS – Logical Methods in Computer Science 13 (3), 2017
24*2017
Logics for Continuous Reachability in Petri Nets and Vector Addition Systems with States
M Blondin, C Haase
LICS – Logic in Computer Science, 2017
222017
Directed Reachability for Infinite-State Systems
M Blondin, C Haase, P Offtermatt
TACAS – Tools and Algorithms for the Construction and Analysis of Systems, 2021
212021
Handling infinitely branching WSTS
M Blondin, A Finkel, P McKenzie
ICALP – Automata, Languages, and Programming, 13–25, 2014
202014
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
192020
Towards Efficient Verification of Population Protocols
M Blondin, S Jaax, J Esparza, PJ Meyer
PODC – Principles of Distributed Computing, 2017
192017
Peregrine: A Tool for the Analysis of Population Protocols
M Blondin, J Esparza, S Jaax
CAV – Computer Aided Verification, 2018
182018
Handling Infinitely Branching Well-structured Transition Systems
M Blondin, A Finkel, P McKenzie
Information and Computation 258, 28–49, 2018
162018
Automata theory: An algorithmic approach
J Esparza, M Blondin
MIT Press, 2023
152023
The Reachability Problem for Two-Dimensional Vector Addition Systems with States
M Blondin, M Englert, A Finkel, S Göller, C Haase, R Lazić, P McKenzie, ...
JACM – Journal of the ACM 68 (5), 2021
142021
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
122020
The Complexity of Intersecting Finite Automata Having Few Final States
M Blondin, A Krebs, P McKenzie
Computational Complexity 25 (4), 775–814, 2016
122016
The Complexity of Intersecting Finite Automata Having Few Final States
M Blondin, P McKenzie
CSR – Computer Science Symposium in Russia, 31–42, 2012
12*2012
The ABCs of Petri net reachability relaxations
M Blondin
ACM SIGLOG News 7 (3), 2020
102020
Expressive Power of Broadcast Consensus Protocols
M Blondin, J Esparza, S Jaax
CONCUR – International Conference on Concurrency Theory, 2019
9*2019
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–20