Volgen
Michael Blondin
Titel
Geciteerd door
Geciteerd door
Jaar
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
662015
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
322016
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
232018
Handling infinitely branching WSTS
M Blondin, A Finkel, P McKenzie
ICALP – Automata, Languages, and Programming, 13–25, 2014
192014
Well Behaved Transition Systems
P McKenzie, A Finkel, M Blondin
LMCS – Logical Methods in Computer Science 13 (3), 2017
18*2017
Towards Efficient Verification of Population Protocols
M Blondin, S Jaax, J Esparza, PJ Meyer
PODC – Principles of Distributed Computing, 2017
182017
The Logical View on Continuous Petri Nets
M Blondin, A Finkel, C Haase, S Haddad
TOCL – ACM Transactions on Computational Logic 18 (3), 2017
172017
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
14*2021
Peregrine: A Tool for the Analysis of Population Protocols
M Blondin, J Esparza, S Jaax
CAV – Computer Aided Verification, 2018
142018
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
132020
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
112020
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
112017
The Complexity of Intersecting Finite Automata Having Few Final States
M Blondin, A Krebs, P McKenzie
Computational Complexity 25 (4), 775–814, 2016
112016
The Complexity of Intersecting Finite Automata Having Few Final States
M Blondin, P McKenzie
CSR – Computer Science Symposium in Russia, 31–42, 2012
11*2012
Logics for Continuous Reachability in Petri Nets and Vector Addition Systems with States
M Blondin, C Haase
LICS – Logic in Computer Science, 2017
102017
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
92018
Handling Infinitely Branching Well-structured Transition Systems
M Blondin, A Finkel, P McKenzie
Information and Computation 258, 28–49, 2018
92018
Automatic Analysis of Expected Termination Time for Population Protocols
M Blondin, J Esparza, A Kučera
CONCUR – International Conference on Concurrency Theory, 2018
82018
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
72020
The ABCs of Petri net reachability relaxations
M Blondin
ACM SIGLOG News 7 (3), 2020
62020
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20