Michael Blondin

60 papers A* 10A 3B 4Misc 1Journal 34Unranked 7

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Soundness of reset workflow nets. CoRR Michael Blondin, Alain Finkel, Piotr Hofman, Filip Mazowiecki, Philip Offtermatt
2025	—	`conf`	Weakly Acyclic Diagrams: A Data Structure for Infinite-State Symbolic Verification. TACAS (3) Michael Blondin, Michaël Cadilhac, Xin-Yi Cui, Philipp Czerner, Javier Esparza, Jakob Schulz
2024	J	`jnl`	Separators in Continuous Petri Nets. Log. Methods Comput. Sci. Michael Blondin, Javier Esparza
2024	A*	`conf`	Soundness of reset workflow nets. LICS Michael Blondin, Alain Finkel, Piotr Hofman, Filip Mazowiecki, Philip Offtermatt
2024	J	`jnl`	Weakly acyclic diagrams: A data structure for infinite-state symbolic verification. CoRR Michael Blondin, Michaël Cadilhac, Xin-Yi Cui, Philipp Czerner, Javier Esparza, Jakob Schulz
2023	J	`jnl`	Continuous One-counter Automata. ACM Trans. Comput. Log. Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt, Guillermo A. Pérez
2023	A*	`conf`	Population Protocols with Unordered Data. ICALP Michael Blondin, François Ladouceur
2023	J	`jnl`	Population Protocols with Unordered Data. CoRR Michael Blondin, François Ladouceur
2023	A*	`conf`	Verifying linear temporal specifications of constant-rate multi-mode systems. LICS Michael Blondin, Philip Offtermatt, Alex Sansfaçon-Buchanan
2023	J	`jnl`	Verifying linear temporal specifications of constant-rate multi-mode systems. CoRR Michael Blondin, Philip Offtermatt, Alex Sansfaçon-Buchanan
2022	B	`conf`	Separators in Continuous Petri Nets. FoSSaCS Michael Blondin, Javier Esparza
2022	J	`jnl`	Separators in Continuous Petri Nets. CoRR Michael Blondin, Javier Esparza
2022	A*	`conf`	The complexity of soundness in workflow nets. LICS Michael Blondin, Filip Mazowiecki, Philip Offtermatt
2022	J	`jnl`	The complexity of soundness in workflow nets. CoRR Michael Blondin, Filip Mazowiecki, Philip Offtermatt
2022	—	`conf`	Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations. CAV (2) Michael Blondin, Filip Mazowiecki, Philip Offtermatt
2022	J	`jnl`	Verifying generalised and structural soundness of workflow nets via relaxations. CoRR Michael Blondin, Filip Mazowiecki, Philip Offtermatt
2021	J	`jnl`	Affine Extensions of Integer Vector Addition Systems with States. Log. Methods Comput. Sci. Michael Blondin, Christoph Haase, Filip Mazowiecki, Mikhail A. Raskin
2021	A*	`conf`	Continuous One-Counter Automata. LICS Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt, Guillermo A. Pérez
2021	J	`jnl`	Continuous One-Counter Automata. CoRR Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt, Guillermo A. Pérez
2021	—	`conf`	Directed Reachability for Infinite-State Systems. TACAS (2) Michael Blondin, Christoph Haase, Philip Offtermatt
2021	J	`jnl`	The Complexity of Reachability in Affine Vector Addition Systems with States. Log. Methods Comput. Sci. Michael Blondin, Mikhail A. Raskin
2021	J	`jnl`	The Reachability Problem for Two-Dimensional Vector Addition Systems with States. J. ACM Michael Blondin, Matthias Englert, Alain Finkel, Stefan Göller, Christoph Haase, Ranko Lazic, Pierre McKenzie, Patrick Totzke
2021	J	`jnl`	Towards efficient verification of population protocols. Formal Methods Syst. Des. Michael Blondin, Javier Esparza, Stefan Jaax, Philipp J. Meyer
2020	—	`conf`	Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling. CAV (2) Michael Blondin, Javier Esparza, Martin Helfrich, Antonín Kucera, Philipp J. Meyer
2020	J	`jnl`	Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling. CoRR Michael Blondin, Javier Esparza, Martin Helfrich, Antonín Kucera, Philipp J. Meyer
2020	J	`jnl`	Directed Reachability for Infinite-State Systems. CoRR Michael Blondin, Christoph Haase, Philip Offtermatt
2020	J	`jnl`	Forward Analysis for WSTS, Part III: Karp-Miller Trees. Log. Methods Comput. Sci. Michael Blondin, Alain Finkel, Jean Goubault-Larrecq
2020	A	`conf`	Succinct Population Protocols for Presburger Arithmetic. STACS Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax
2020	J	`jnl`	The ABCs of petri net reachability relaxations. ACM SIGLOG News Michael Blondin
2020	A*	`conf`	The Complexity of Reachability in Affine Vector Addition Systems with States. LICS Michael Blondin, Mikhail A. Raskin
2019	J	`jnl`	Affine Extensions of Integer Vector Addition Systems with States. CoRR Michael Blondin, Christoph Haase, Filip Mazowiecki, Mikhail A. Raskin
2019	B	`conf`	Expressive Power of Broadcast Consensus Protocols. CONCUR Michael Blondin, Javier Esparza, Stefan Jaax
2019	J	`jnl`	Expressive Power of Oblivious Consensus Protocols. CoRR Michael Blondin, Javier Esparza, Stefan Jaax
2019	J	`jnl`	Succinct Population Protocols for Presburger Arithmetic. CoRR Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax
2019	J	`jnl`	The Complexity of Reachability in Affine Vector Addition Systems with States. CoRR Michael Blondin, Mikhail A. Raskin
2018	B	`conf`	Affine Extensions of Integer Vector Addition Systems with States. CONCUR Michael Blondin, Christoph Haase, Filip Mazowiecki
2018	B	`conf`	Automatic Analysis of Expected Termination Time for Population Protocols. CONCUR Michael Blondin, Javier Esparza, Antonín Kucera
2018	J	`jnl`	Automatic Analysis of Expected Termination Time for Population Protocols. CoRR Michael Blondin, Javier Esparza, Antonín Kucera
2018	A*	`conf`	Black Ninjas in the Dark: Formal Analysis of Population Protocols. LICS Michael Blondin, Javier Esparza, Stefan Jaax, Antonín Kucera
2018	J	`jnl`	Handling infinitely branching well-structured transition systems. Inf. Comput. Michael Blondin, Alain Finkel, Pierre McKenzie
2018	J	`jnl`	Large Flocks of Small Birds: On the Minimal Size of Population Protocols. CoRR Michael Blondin, Javier Esparza, Stefan Jaax
2018	A	`conf`	Large Flocks of Small Birds: on the Minimal Size of Population Protocols. STACS Michael Blondin, Javier Esparza, Stefan Jaax
2018	—	`conf`	Peregrine: A Tool for the Analysis of Population Protocols. CAV (1) Michael Blondin, Javier Esparza, Stefan Jaax
2017	—	`conf`	Forward Analysis for WSTS, Part III: Karp-Miller Trees. FSTTCS Michael Blondin, Alain Finkel, Jean Goubault-Larrecq
2017	J	`jnl`	Forward Analysis for WSTS, Part III: Karp-Miller Trees. CoRR Michael Blondin, Alain Finkel, Jean Goubault-Larrecq
2017	A*	`conf`	Logics for continuous reachability in Petri nets and vector addition systems with states. LICS Michael Blondin, Christoph Haase
2017	J	`jnl`	The Logical View on Continuous Petri Nets. ACM Trans. Comput. Log. Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad
2017	A*	`conf`	Towards Efficient Verification of Population Protocols. PODC Michael Blondin, Javier Esparza, Stefan Jaax, Philipp J. Meyer
2017	J	`jnl`	Towards Efficient Verification of Population Protocols. CoRR Michael Blondin, Stefan Jaax, Javier Esparza, Philipp J. Meyer
2017	J	`jnl`	Well Behaved Transition Systems. Log. Methods Comput. Sci. Michael Blondin, Alain Finkel, Pierre McKenzie
2016	—	`—`	Algorithmique et complexité des systèmes à compteurs. (Algorithmics and complexity of counter machines). Michael Blondin
2016	A	`conf`	Approaching the Coverability Problem Continuously. TACAS Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad
2016	J	`jnl`	The complexity of intersecting finite automata having few final states. Comput. Complex. Michael Blondin, Andreas Krebs, Pierre McKenzie
2016	J	`jnl`	Well Behaved Transition Systems. CoRR Michael Blondin, Alain Finkel, Pierre McKenzie
2015	J	`jnl`	Approaching the Coverability Problem Continuously. CoRR Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad
2015	A*	`conf`	Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete. LICS Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, Pierre McKenzie
2014	—	`conf`	Handling Infinitely Branching WSTS. ICALP (2) Michael Blondin, Alain Finkel, Pierre McKenzie
2014	J	`jnl`	Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete. CoRR Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, Pierre McKenzie
2012	Misc	`conf`	The Complexity of Intersecting Finite Automata Having Few Final States. CSR Michael Blondin, Pierre McKenzie
2012	J	`jnl`	The Complexity of Intersecting Finite Automata Having Few Final States. Electron. Colloquium Comput. Complex. Michael Blondin, Andreas Krebs, Pierre McKenzie