default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 59 matches
- 2024
- Michael Blondin
, Javier Esparza:
Separators in Continuous Petri Nets. Log. Methods Comput. Sci. 20(1) (2024) - Michael Blondin, Alain Finkel, Piotr Hofman, Filip Mazowiecki, Philip Offtermatt:
Soundness of reset workflow nets. LICS 2024: 13:1-13:14 - 2023
- 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) - Michael Blondin, François Ladouceur:
Population Protocols with Unordered Data. ICALP 2023: 115:1-115:20 - Michael Blondin, Philip Offtermatt, Alex Sansfaçon-Buchanan:
Verifying linear temporal specifications of constant-rate multi-mode systems. LICS 2023: 1-13 - Michael Blondin, Philip Offtermatt, Alex Sansfaçon-Buchanan:
Verifying linear temporal specifications of constant-rate multi-mode systems. CoRR abs/2304.13816 (2023) - Michael Blondin, François Ladouceur:
Population Protocols with Unordered Data. CoRR abs/2305.00872 (2023) - 2022
- Michael Blondin, Filip Mazowiecki, Philip Offtermatt:
Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations. CAV (2) 2022: 468-489 - Michael Blondin, Javier Esparza:
Separators in Continuous Petri Nets. FoSSaCS 2022: 81-100 - Michael Blondin, Filip Mazowiecki, Philip Offtermatt:
The complexity of soundness in workflow nets. LICS 2022: 20:1-20:13 - Michael Blondin, Filip Mazowiecki, Philip Offtermatt:
The complexity of soundness in workflow nets. CoRR abs/2201.05588 (2022) - Michael Blondin, Filip Mazowiecki, Philip Offtermatt:
Verifying generalised and structural soundness of workflow nets via relaxations. CoRR abs/2206.02606 (2022) - Michael Blondin, Javier Esparza:
Separators in Continuous Petri Nets. CoRR abs/2209.02767 (2022) - 2021
- Michael Blondin, Javier Esparza, Stefan Jaax, Philipp J. Meyer:
Towards efficient verification of population protocols. Formal Methods Syst. Des. 57(3): 305-342 (2021) - 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) - 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) - Michael Blondin, Mikhail A. Raskin:
The Complexity of Reachability in Affine Vector Addition Systems with States. Log. Methods Comput. Sci. 17(3) (2021) - Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt, Guillermo A. Pérez:
Continuous One-Counter Automata. LICS 2021: 1-13 - Michael Blondin, Christoph Haase, Philip Offtermatt:
Directed Reachability for Infinite-State Systems. TACAS (2) 2021: 3-23 - Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt, Guillermo A. Pérez:
Continuous One-Counter Automata. CoRR abs/2101.11996 (2021) - 2020
- Michael Blondin, Alain Finkel, Jean Goubault-Larrecq:
Forward Analysis for WSTS, Part III: Karp-Miller Trees. Log. Methods Comput. Sci. 16(2) (2020) - Michael Blondin:
The ABCs of petri net reachability relaxations. ACM SIGLOG News 7(3): 29-43 (2020) - 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 - Michael Blondin, Mikhail A. Raskin:
The Complexity of Reachability in Affine Vector Addition Systems with States. LICS 2020: 224-236 - Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax:
Succinct Population Protocols for Presburger Arithmetic. STACS 2020: 40:1-40:15 - 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) - Michael Blondin, Christoph Haase, Philip Offtermatt:
Directed Reachability for Infinite-State Systems. CoRR abs/2010.07912 (2020) - 2019
- Michael Blondin, Javier Esparza, Stefan Jaax:
Expressive Power of Broadcast Consensus Protocols. CONCUR 2019: 31:1-31:16 - Michael Blondin, Javier Esparza, Stefan Jaax:
Expressive Power of Oblivious Consensus Protocols. CoRR abs/1902.01668 (2019) - Michael Blondin, Mikhail A. Raskin:
The Complexity of Reachability in Affine Vector Addition Systems with States. CoRR abs/1909.02579 (2019)
skipping 29 more matches
loading more results 
failed to load more results, please try again later
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.
retrieved on 2024-12-09 08:22 CET from data curated 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:
