default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Blondin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Michael Blondin
, Javier Esparza:
Separators in Continuous Petri Nets. Log. Methods Comput. Sci. 20(1) (2024)- [c24]Michael Blondin, Alain Finkel, Piotr Hofman, Filip Mazowiecki, Philip Offtermatt:
Soundness of reset workflow nets. LICS 2024: 13:1-13:14 - 2023
- [j11]Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt, Guillermo A. Pérez:
Continuous One-counter Automata. ACM Trans. Comput. Log. 24(1): 3:1-3:31 (2023) - [c23]Michael Blondin, François Ladouceur:
Population Protocols with Unordered Data. ICALP 2023: 115:1-115:20 - [c22]Michael Blondin, Philip Offtermatt, Alex Sansfaçon-Buchanan:
Verifying linear temporal specifications of constant-rate multi-mode systems. LICS 2023: 1-13 - [i20]Michael Blondin, Philip Offtermatt, Alex Sansfaçon-Buchanan:
Verifying linear temporal specifications of constant-rate multi-mode systems. CoRR abs/2304.13816 (2023) - [i19]Michael Blondin, François Ladouceur:
Population Protocols with Unordered Data. CoRR abs/2305.00872 (2023) - 2022
- [c21]Michael Blondin, Filip Mazowiecki, Philip Offtermatt:
Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations. CAV (2) 2022: 468-489 - [c20]Michael Blondin, Javier Esparza:
Separators in Continuous Petri Nets. FoSSaCS 2022: 81-100 - [c19]Michael Blondin, Filip Mazowiecki, Philip Offtermatt:
The complexity of soundness in workflow nets. LICS 2022: 20:1-20:13 - [i18]Michael Blondin, Filip Mazowiecki, Philip Offtermatt:
The complexity of soundness in workflow nets. CoRR abs/2201.05588 (2022) - [i17]Michael Blondin, Filip Mazowiecki, Philip Offtermatt:
Verifying generalised and structural soundness of workflow nets via relaxations. CoRR abs/2206.02606 (2022) - [i16]Michael Blondin, Javier Esparza:
Separators in Continuous Petri Nets. CoRR abs/2209.02767 (2022) - 2021
- [j10]Michael Blondin, Javier Esparza, Stefan Jaax, Philipp J. Meyer:
Towards efficient verification of population protocols. Formal Methods Syst. Des. 57(3): 305-342 (2021) - [j9]Michael Blondin, Matthias Englert, Alain Finkel, Stefan Göller, Christoph Haase, Ranko Lazic, Pierre McKenzie, Patrick Totzke:
The Reachability Problem for Two-Dimensional Vector Addition Systems with States. J. ACM 68(5): 34:1-34:43 (2021) - [j8]Michael Blondin, Christoph Haase, Filip Mazowiecki, Mikhail A. Raskin:
Affine Extensions of Integer Vector Addition Systems with States. Log. Methods Comput. Sci. 17(3) (2021) - [j7]Michael Blondin, Mikhail A. Raskin:
The Complexity of Reachability in Affine Vector Addition Systems with States. Log. Methods Comput. Sci. 17(3) (2021) - [c18]Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt, Guillermo A. Pérez:
Continuous One-Counter Automata. LICS 2021: 1-13 - [c17]Michael Blondin, Christoph Haase, Philip Offtermatt:
Directed Reachability for Infinite-State Systems. TACAS (2) 2021: 3-23 - [i15]Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt, Guillermo A. Pérez:
Continuous One-Counter Automata. CoRR abs/2101.11996 (2021) - 2020
- [j6]Michael Blondin, Alain Finkel, Jean Goubault-Larrecq:
Forward Analysis for WSTS, Part III: Karp-Miller Trees. Log. Methods Comput. Sci. 16(2) (2020) - [j5]Michael Blondin:
The ABCs of petri net reachability relaxations. ACM SIGLOG News 7(3): 29-43 (2020) - [c16]Michael Blondin, Javier Esparza, Martin Helfrich, Antonín Kucera, Philipp J. Meyer:
Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling. CAV (2) 2020: 372-397 - [c15]Michael Blondin, Mikhail A. Raskin:
The Complexity of Reachability in Affine Vector Addition Systems with States. LICS 2020: 224-236 - [c14]Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax:
Succinct Population Protocols for Presburger Arithmetic. STACS 2020: 40:1-40:15 - [i14]Michael Blondin, Javier Esparza, Martin Helfrich, Antonín Kucera, Philipp J. Meyer:
Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling. CoRR abs/2005.03555 (2020) - [i13]Michael Blondin, Christoph Haase, Philip Offtermatt:
Directed Reachability for Infinite-State Systems. CoRR abs/2010.07912 (2020)
2010 – 2019
- 2019
- [c13]Michael Blondin, Javier Esparza, Stefan Jaax:
Expressive Power of Broadcast Consensus Protocols. CONCUR 2019: 31:1-31:16 - [i12]Michael Blondin, Javier Esparza, Stefan Jaax:
Expressive Power of Oblivious Consensus Protocols. CoRR abs/1902.01668 (2019) - [i11]Michael Blondin, Mikhail A. Raskin:
The Complexity of Reachability in Affine Vector Addition Systems with States. CoRR abs/1909.02579 (2019) - [i10]Michael Blondin, Christoph Haase, Filip Mazowiecki, Mikhail A. Raskin:
Affine Extensions of Integer Vector Addition Systems with States. CoRR abs/1909.12386 (2019) - [i9]Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax:
Succinct Population Protocols for Presburger Arithmetic. CoRR abs/1910.04600 (2019) - 2018
- [j4]Michael Blondin, Alain Finkel, Pierre McKenzie:
Handling infinitely branching well-structured transition systems. Inf. Comput. 258: 28-49 (2018) - [c12]Michael Blondin, Javier Esparza, Stefan Jaax:
Peregrine: A Tool for the Analysis of Population Protocols. CAV (1) 2018: 604-611 - [c11]Michael Blondin, Christoph Haase, Filip Mazowiecki:
Affine Extensions of Integer Vector Addition Systems with States. CONCUR 2018: 14:1-14:17 - [c10]Michael Blondin, Javier Esparza, Antonín Kucera:
Automatic Analysis of Expected Termination Time for Population Protocols. CONCUR 2018: 33:1-33:16 - [c9]Michael Blondin, Javier Esparza, Stefan Jaax, Antonín Kucera:
Black Ninjas in the Dark: Formal Analysis of Population Protocols. LICS 2018: 1-10 - [c8]Michael Blondin, Javier Esparza, Stefan Jaax:
Large Flocks of Small Birds: on the Minimal Size of Population Protocols. STACS 2018: 16:1-16:14 - [i8]Michael Blondin, Javier Esparza, Stefan Jaax:
Large Flocks of Small Birds: On the Minimal Size of Population Protocols. CoRR abs/1801.00742 (2018) - [i7]Michael Blondin, Javier Esparza, Antonín Kucera:
Automatic Analysis of Expected Termination Time for Population Protocols. CoRR abs/1807.00331 (2018) - 2017
- [j3]Michael Blondin, Alain Finkel, Pierre McKenzie:
Well Behaved Transition Systems. Log. Methods Comput. Sci. 13(3) (2017) - [j2]Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad:
The Logical View on Continuous Petri Nets. ACM Trans. Comput. Log. 18(3): 24:1-24:28 (2017) - [c7]Michael Blondin, Alain Finkel, Jean Goubault-Larrecq:
Forward Analysis for WSTS, Part III: Karp-Miller Trees. FSTTCS 2017: 16:1-16:15 - [c6]Michael Blondin, Christoph Haase:
Logics for continuous reachability in Petri nets and vector addition systems with states. LICS 2017: 1-12 - [c5]Michael Blondin, Javier Esparza, Stefan Jaax, Philipp J. Meyer:
Towards Efficient Verification of Population Protocols. PODC 2017: 423-430 - [i6]Michael Blondin, Stefan Jaax, Javier Esparza, Philipp J. Meyer:
Towards Efficient Verification of Population Protocols. CoRR abs/1703.04367 (2017) - [i5]Michael Blondin, Alain Finkel, Jean Goubault-Larrecq:
Forward Analysis for WSTS, Part III: Karp-Miller Trees. CoRR abs/1710.07258 (2017) - 2016
- [b1]Michael Blondin:
Algorithmique et complexité des systèmes à compteurs. (Algorithmics and complexity of counter machines). University of Paris-Saclay, France, 2016 - [j1]Michael Blondin, Andreas Krebs, Pierre McKenzie:
The complexity of intersecting finite automata having few final states. Comput. Complex. 25(4): 775-814 (2016) - [c4]Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad:
Approaching the Coverability Problem Continuously. TACAS 2016: 480-496 - [i4]Michael Blondin, Alain Finkel, Pierre McKenzie:
Well Behaved Transition Systems. CoRR abs/1608.02636 (2016) - 2015
- [c3]Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, Pierre McKenzie:
Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete. LICS 2015: 32-43 - [i3]Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad:
Approaching the Coverability Problem Continuously. CoRR abs/1510.05724 (2015) - 2014
- [c2]Michael Blondin, Alain Finkel, Pierre McKenzie:
Handling Infinitely Branching WSTS. ICALP (2) 2014: 13-25 - [i2]Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, Pierre McKenzie:
Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete. CoRR abs/1412.4259 (2014) - 2012
- [c1]Michael Blondin, Pierre McKenzie:
The Complexity of Intersecting Finite Automata Having Few Final States. CSR 2012: 31-42 - [i1]Michael Blondin, Andreas Krebs, Pierre McKenzie:
The Complexity of Intersecting Finite Automata Having Few Final States. Electron. Colloquium Comput. Complex. TR12 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
