Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Michael Blondin
@article{DBLP:journals/lmcs/BlondinE24,
author = {Michael Blondin and
Javier Esparza},
title = {Separators in Continuous Petri Nets},
journal = {Log. Methods Comput. Sci.},
volume = {20},
number = {1},
year = {2024},
url = {https://doi.org/10.46298/lmcs-20(1:15)2024},
doi = {10.46298/LMCS-20(1:15)2024},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/lmcs/BlondinE24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/BlondinLMOP23,
author = {Michael Blondin and
Tim Leys and
Filip Mazowiecki and
Philip Offtermatt and
Guillermo A. P{\'{e}}rez},
title = {Continuous One-counter Automata},
journal = {{ACM} Trans. Comput. Log.},
volume = {24},
number = {1},
pages = {3:1--3:31},
year = {2023},
url = {https://doi.org/10.1145/3558549},
doi = {10.1145/3558549},
timestamp = {Sun, 16 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tocl/BlondinLMOP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BlondinL23,
author = {Michael Blondin and
Fran{\c{c}}ois Ladouceur},
editor = {Kousha Etessami and
Uriel Feige and
Gabriele Puppis},
title = {Population Protocols with Unordered Data},
booktitle = {50th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2023, July 10-14, 2023, Paderborn, Germany},
series = {LIPIcs},
volume = {261},
pages = {115:1--115:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.115},
doi = {10.4230/LIPICS.ICALP.2023.115},
timestamp = {Wed, 05 Jul 2023 16:19:52 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BlondinL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/BlondinOS23,
author = {Michael Blondin and
Philip Offtermatt and
Alex Sansfa{\c{c}}on{-}Buchanan},
title = {Verifying linear temporal specifications of constant-rate multi-mode
systems},
booktitle = {{LICS}},
pages = {1--13},
year = {2023},
url = {https://doi.org/10.1109/LICS56636.2023.10175721},
doi = {10.1109/LICS56636.2023.10175721},
timestamp = {Thu, 20 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lics/BlondinOS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-13816,
author = {Michael Blondin and
Philip Offtermatt and
Alex Sansfa{\c{c}}on{-}Buchanan},
title = {Verifying linear temporal specifications of constant-rate multi-mode
systems},
journal = {CoRR},
volume = {abs/2304.13816},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.13816},
doi = {10.48550/ARXIV.2304.13816},
eprinttype = {arXiv},
eprint = {2304.13816},
timestamp = {Wed, 03 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-13816.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-00872,
author = {Michael Blondin and
Fran{\c{c}}ois Ladouceur},
title = {Population Protocols with Unordered Data},
journal = {CoRR},
volume = {abs/2305.00872},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.00872},
doi = {10.48550/ARXIV.2305.00872},
eprinttype = {arXiv},
eprint = {2305.00872},
timestamp = {Fri, 05 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-00872.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cav/BlondinMO22,
author = {Michael Blondin and
Filip Mazowiecki and
Philip Offtermatt},
editor = {Sharon Shoham and
Yakir Vizel},
title = {Verifying Generalised and Structural Soundness of Workflow Nets via
Relaxations},
booktitle = {Computer Aided Verification - 34th International Conference, {CAV}
2022, Haifa, Israel, August 7-10, 2022, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {13372},
pages = {468--489},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-13188-2\_23},
doi = {10.1007/978-3-031-13188-2\_23},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cav/BlondinMO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fossacs/BlondinE22,
author = {Michael Blondin and
Javier Esparza},
editor = {Patricia Bouyer and
Lutz Schr{\"{o}}der},
title = {Separators in Continuous Petri Nets},
booktitle = {Foundations of Software Science and Computation Structures - 25th
International Conference, {FOSSACS} 2022, Held as Part of the European
Joint Conferences on Theory and Practice of Software, {ETAPS} 2022,
Munich, Germany, April 2-7, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13242},
pages = {81--100},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-030-99253-8\_5},
doi = {10.1007/978-3-030-99253-8\_5},
timestamp = {Fri, 29 Apr 2022 14:50:32 +0200},
biburl = {https://dblp.org/rec/conf/fossacs/BlondinE22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/BlondinMO22,
author = {Michael Blondin and
Filip Mazowiecki and
Philip Offtermatt},
editor = {Christel Baier and
Dana Fisman},
title = {The complexity of soundness in workflow nets},
booktitle = {{LICS} '22: 37th Annual {ACM/IEEE} Symposium on Logic in Computer
Science, Haifa, Israel, August 2 - 5, 2022},
pages = {20:1--20:13},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3531130.3533341},
doi = {10.1145/3531130.3533341},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lics/BlondinMO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-05588,
author = {Michael Blondin and
Filip Mazowiecki and
Philip Offtermatt},
title = {The complexity of soundness in workflow nets},
journal = {CoRR},
volume = {abs/2201.05588},
year = {2022},
url = {https://arxiv.org/abs/2201.05588},
eprinttype = {arXiv},
eprint = {2201.05588},
timestamp = {Thu, 20 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-05588.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-02606,
author = {Michael Blondin and
Filip Mazowiecki and
Philip Offtermatt},
title = {Verifying generalised and structural soundness of workflow nets via
relaxations},
journal = {CoRR},
volume = {abs/2206.02606},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.02606},
doi = {10.48550/ARXIV.2206.02606},
eprinttype = {arXiv},
eprint = {2206.02606},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-02606.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-02767,
author = {Michael Blondin and
Javier Esparza},
title = {Separators in Continuous Petri Nets},
journal = {CoRR},
volume = {abs/2209.02767},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.02767},
doi = {10.48550/ARXIV.2209.02767},
eprinttype = {arXiv},
eprint = {2209.02767},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-02767.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fmsd/BlondinEJM21,
author = {Michael Blondin and
Javier Esparza and
Stefan Jaax and
Philipp J. Meyer},
title = {Towards efficient verification of population protocols},
journal = {Formal Methods Syst. Des.},
volume = {57},
number = {3},
pages = {305--342},
year = {2021},
url = {https://doi.org/10.1007/s10703-021-00367-3},
doi = {10.1007/S10703-021-00367-3},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/fmsd/BlondinEJM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BlondinEFGHLMT21,
author = {Michael Blondin and
Matthias Englert and
Alain Finkel and
Stefan G{\"{o}}ller and
Christoph Haase and
Ranko Lazic and
Pierre McKenzie and
Patrick Totzke},
title = {The Reachability Problem for Two-Dimensional Vector Addition Systems
with States},
journal = {J. {ACM}},
volume = {68},
number = {5},
pages = {34:1--34:43},
year = {2021},
url = {https://doi.org/10.1145/3464794},
doi = {10.1145/3464794},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BlondinEFGHLMT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmcs/BlondinHMR21,
author = {Michael Blondin and
Christoph Haase and
Filip Mazowiecki and
Mikhail A. Raskin},
title = {Affine Extensions of Integer Vector Addition Systems with States},
journal = {Log. Methods Comput. Sci.},
volume = {17},
number = {3},
year = {2021},
url = {https://doi.org/10.46298/lmcs-17(3:1)2021},
doi = {10.46298/LMCS-17(3:1)2021},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/lmcs/BlondinHMR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmcs/BlondinR21,
author = {Michael Blondin and
Mikhail A. Raskin},
title = {The Complexity of Reachability in Affine Vector Addition Systems with
States},
journal = {Log. Methods Comput. Sci.},
volume = {17},
number = {3},
year = {2021},
url = {https://doi.org/10.46298/lmcs-17(3:3)2021},
doi = {10.46298/LMCS-17(3:3)2021},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/lmcs/BlondinR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/BlondinLMOP21,
author = {Michael Blondin and
Tim Leys and
Filip Mazowiecki and
Philip Offtermatt and
Guillermo A. P{\'{e}}rez},
title = {Continuous One-Counter Automata},
booktitle = {36th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}
2021, Rome, Italy, June 29 - July 2, 2021},
pages = {1--13},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/LICS52264.2021.9470525},
doi = {10.1109/LICS52264.2021.9470525},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/BlondinLMOP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tacas/BlondinHO21,
author = {Michael Blondin and
Christoph Haase and
Philip Offtermatt},
editor = {Jan Friso Groote and
Kim Guldstrand Larsen},
title = {Directed Reachability for Infinite-State Systems},
booktitle = {Tools and Algorithms for the Construction and Analysis of Systems
- 27th International Conference, {TACAS} 2021, Held as Part of the
European Joint Conferences on Theory and Practice of Software, {ETAPS}
2021, Luxembourg City, Luxembourg, March 27 - April 1, 2021, Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {12652},
pages = {3--23},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-72013-1\_1},
doi = {10.1007/978-3-030-72013-1\_1},
timestamp = {Fri, 14 May 2021 08:34:19 +0200},
biburl = {https://dblp.org/rec/conf/tacas/BlondinHO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-11996,
author = {Michael Blondin and
Tim Leys and
Filip Mazowiecki and
Philip Offtermatt and
Guillermo A. P{\'{e}}rez},
title = {Continuous One-Counter Automata},
journal = {CoRR},
volume = {abs/2101.11996},
year = {2021},
url = {https://arxiv.org/abs/2101.11996},
eprinttype = {arXiv},
eprint = {2101.11996},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-11996.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmcs/BlondinFG20,
author = {Michael Blondin and
Alain Finkel and
Jean Goubault{-}Larrecq},
title = {Forward Analysis for WSTS, Part {III:} Karp-Miller Trees},
journal = {Log. Methods Comput. Sci.},
volume = {16},
number = {2},
year = {2020},
url = {https://doi.org/10.23638/LMCS-16(2:13)2020},
doi = {10.23638/LMCS-16(2:13)2020},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/lmcs/BlondinFG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siglog/Blondin20,
author = {Michael Blondin},
title = {The ABCs of petri net reachability relaxations},
journal = {{ACM} {SIGLOG} News},
volume = {7},
number = {3},
pages = {29--43},
year = {2020},
url = {https://doi.org/10.1145/3436980.3436984},
doi = {10.1145/3436980.3436984},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siglog/Blondin20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cav/BlondinEH0M20,
author = {Michael Blondin and
Javier Esparza and
Martin Helfrich and
Anton{\'{\i}}n Kucera and
Philipp J. Meyer},
editor = {Shuvendu K. Lahiri and
Chao Wang},
title = {Checking Qualitative Liveness Properties of Replicated Systems with
Stochastic Scheduling},
booktitle = {Computer Aided Verification - 32nd International Conference, {CAV}
2020, Los Angeles, CA, USA, July 21-24, 2020, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {12225},
pages = {372--397},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-53291-8\_20},
doi = {10.1007/978-3-030-53291-8\_20},
timestamp = {Wed, 12 Aug 2020 15:15:44 +0200},
biburl = {https://dblp.org/rec/conf/cav/BlondinEH0M20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/BlondinR20,
author = {Michael Blondin and
Mikhail A. Raskin},
editor = {Holger Hermanns and
Lijun Zhang and
Naoki Kobayashi and
Dale Miller},
title = {The Complexity of Reachability in Affine Vector Addition Systems with
States},
booktitle = {{LICS} '20: 35th Annual {ACM/IEEE} Symposium on Logic in Computer
Science, Saarbr{\"{u}}cken, Germany, July 8-11, 2020},
pages = {224--236},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3373718.3394741},
doi = {10.1145/3373718.3394741},
timestamp = {Sat, 30 Sep 2023 09:52:07 +0200},
biburl = {https://dblp.org/rec/conf/lics/BlondinR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BlondinEGHJ20,
author = {Michael Blondin and
Javier Esparza and
Blaise Genest and
Martin Helfrich and
Stefan Jaax},
editor = {Christophe Paul and
Markus Bl{\"{a}}ser},
title = {Succinct Population Protocols for Presburger Arithmetic},
booktitle = {37th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2020, March 10-13, 2020, Montpellier, France},
series = {LIPIcs},
volume = {154},
pages = {40:1--40:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.STACS.2020.40},
doi = {10.4230/LIPICS.STACS.2020.40},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BlondinEGHJ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-03555,
author = {Michael Blondin and
Javier Esparza and
Martin Helfrich and
Anton{\'{\i}}n Kucera and
Philipp J. Meyer},
title = {Checking Qualitative Liveness Properties of Replicated Systems with
Stochastic Scheduling},
journal = {CoRR},
volume = {abs/2005.03555},
year = {2020},
url = {https://arxiv.org/abs/2005.03555},
eprinttype = {arXiv},
eprint = {2005.03555},
timestamp = {Sun, 10 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-03555.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-07912,
author = {Michael Blondin and
Christoph Haase and
Philip Offtermatt},
title = {Directed Reachability for Infinite-State Systems},
journal = {CoRR},
volume = {abs/2010.07912},
year = {2020},
url = {https://arxiv.org/abs/2010.07912},
eprinttype = {arXiv},
eprint = {2010.07912},
timestamp = {Wed, 21 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-07912.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/BlondinEJ19,
author = {Michael Blondin and
Javier Esparza and
Stefan Jaax},
editor = {Wan J. Fokkink and
Rob van Glabbeek},
title = {Expressive Power of Broadcast Consensus Protocols},
booktitle = {30th International Conference on Concurrency Theory, {CONCUR} 2019,
August 27-30, 2019, Amsterdam, the Netherlands},
series = {LIPIcs},
volume = {140},
pages = {31:1--31:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2019.31},
doi = {10.4230/LIPICS.CONCUR.2019.31},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/BlondinEJ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-01668,
author = {Michael Blondin and
Javier Esparza and
Stefan Jaax},
title = {Expressive Power of Oblivious Consensus Protocols},
journal = {CoRR},
volume = {abs/1902.01668},
year = {2019},
url = {http://arxiv.org/abs/1902.01668},
eprinttype = {arXiv},
eprint = {1902.01668},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-01668.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-02579,
author = {Michael Blondin and
Mikhail A. Raskin},
title = {The Complexity of Reachability in Affine Vector Addition Systems with
States},
journal = {CoRR},
volume = {abs/1909.02579},
year = {2019},
url = {http://arxiv.org/abs/1909.02579},
eprinttype = {arXiv},
eprint = {1909.02579},
timestamp = {Wed, 13 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-02579.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-12386,
author = {Michael Blondin and
Christoph Haase and
Filip Mazowiecki and
Mikhail A. Raskin},
title = {Affine Extensions of Integer Vector Addition Systems with States},
journal = {CoRR},
volume = {abs/1909.12386},
year = {2019},
url = {http://arxiv.org/abs/1909.12386},
eprinttype = {arXiv},
eprint = {1909.12386},
timestamp = {Wed, 13 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-12386.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-04600,
author = {Michael Blondin and
Javier Esparza and
Blaise Genest and
Martin Helfrich and
Stefan Jaax},
title = {Succinct Population Protocols for Presburger Arithmetic},
journal = {CoRR},
volume = {abs/1910.04600},
year = {2019},
url = {http://arxiv.org/abs/1910.04600},
eprinttype = {arXiv},
eprint = {1910.04600},
timestamp = {Wed, 16 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-04600.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BlondinFM18,
author = {Michael Blondin and
Alain Finkel and
Pierre McKenzie},
title = {Handling infinitely branching well-structured transition systems},
journal = {Inf. Comput.},
volume = {258},
pages = {28--49},
year = {2018},
url = {https://doi.org/10.1016/j.ic.2017.11.001},
doi = {10.1016/J.IC.2017.11.001},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BlondinFM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cav/BlondinEJ18,
author = {Michael Blondin and
Javier Esparza and
Stefan Jaax},
editor = {Hana Chockler and
Georg Weissenbacher},
title = {Peregrine: {A} Tool for the Analysis of Population Protocols},
booktitle = {Computer Aided Verification - 30th International Conference, {CAV}
2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford,
UK, July 14-17, 2018, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {10981},
pages = {604--611},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-96145-3\_34},
doi = {10.1007/978-3-319-96145-3\_34},
timestamp = {Fri, 09 Apr 2021 18:35:27 +0200},
biburl = {https://dblp.org/rec/conf/cav/BlondinEJ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/BlondinHM18,
author = {Michael Blondin and
Christoph Haase and
Filip Mazowiecki},
editor = {Sven Schewe and
Lijun Zhang},
title = {Affine Extensions of Integer Vector Addition Systems with States},
booktitle = {29th International Conference on Concurrency Theory, {CONCUR} 2018,
September 4-7, 2018, Beijing, China},
series = {LIPIcs},
volume = {118},
pages = {14:1--14:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2018.14},
doi = {10.4230/LIPICS.CONCUR.2018.14},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/concur/BlondinHM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/BlondinEK18,
author = {Michael Blondin and
Javier Esparza and
Anton{\'{\i}}n Kucera},
editor = {Sven Schewe and
Lijun Zhang},
title = {Automatic Analysis of Expected Termination Time for Population Protocols},
booktitle = {29th International Conference on Concurrency Theory, {CONCUR} 2018,
September 4-7, 2018, Beijing, China},
series = {LIPIcs},
volume = {118},
pages = {33:1--33:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2018.33},
doi = {10.4230/LIPICS.CONCUR.2018.33},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/BlondinEK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/BlondinEJK18,
author = {Michael Blondin and
Javier Esparza and
Stefan Jaax and
Anton{\'{\i}}n Kucera},
editor = {Anuj Dawar and
Erich Gr{\"{a}}del},
title = {Black Ninjas in the Dark: Formal Analysis of Population Protocols},
booktitle = {Proceedings of the 33rd Annual {ACM/IEEE} Symposium on Logic in Computer
Science, {LICS} 2018, Oxford, UK, July 09-12, 2018},
pages = {1--10},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3209108.3209110},
doi = {10.1145/3209108.3209110},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lics/BlondinEJK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BlondinEJ18,
author = {Michael Blondin and
Javier Esparza and
Stefan Jaax},
editor = {Rolf Niedermeier and
Brigitte Vall{\'{e}}e},
title = {Large Flocks of Small Birds: on the Minimal Size of Population Protocols},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science, {STACS}
2018, February 28 to March 3, 2018, Caen, France},
series = {LIPIcs},
volume = {96},
pages = {16:1--16:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.STACS.2018.16},
doi = {10.4230/LIPICS.STACS.2018.16},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BlondinEJ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1801-00742,
author = {Michael Blondin and
Javier Esparza and
Stefan Jaax},
title = {Large Flocks of Small Birds: On the Minimal Size of Population Protocols},
journal = {CoRR},
volume = {abs/1801.00742},
year = {2018},
url = {http://arxiv.org/abs/1801.00742},
eprinttype = {arXiv},
eprint = {1801.00742},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1801-00742.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-00331,
author = {Michael Blondin and
Javier Esparza and
Anton{\'{\i}}n Kucera},
title = {Automatic Analysis of Expected Termination Time for Population Protocols},
journal = {CoRR},
volume = {abs/1807.00331},
year = {2018},
url = {http://arxiv.org/abs/1807.00331},
eprinttype = {arXiv},
eprint = {1807.00331},
timestamp = {Fri, 30 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-00331.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmcs/BlondinFM17,
author = {Michael Blondin and
Alain Finkel and
Pierre McKenzie},
title = {Well Behaved Transition Systems},
journal = {Log. Methods Comput. Sci.},
volume = {13},
number = {3},
year = {2017},
url = {https://doi.org/10.23638/LMCS-13(3:24)2017},
doi = {10.23638/LMCS-13(3:24)2017},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/lmcs/BlondinFM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/BlondinFHH17,
author = {Michael Blondin and
Alain Finkel and
Christoph Haase and
Serge Haddad},
title = {The Logical View on Continuous Petri Nets},
journal = {{ACM} Trans. Comput. Log.},
volume = {18},
number = {3},
pages = {24:1--24:28},
year = {2017},
url = {https://doi.org/10.1145/3105908},
doi = {10.1145/3105908},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tocl/BlondinFHH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BlondinFG17,
author = {Michael Blondin and
Alain Finkel and
Jean Goubault{-}Larrecq},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Forward Analysis for WSTS, Part {III:} Karp-Miller Trees},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {16:1--16:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.16},
doi = {10.4230/LIPICS.FSTTCS.2017.16},
timestamp = {Fri, 03 Sep 2021 15:00:19 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/BlondinFG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/BlondinH17,
author = {Michael Blondin and
Christoph Haase},
title = {Logics for continuous reachability in Petri nets and vector addition
systems with states},
booktitle = {32nd Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}
2017, Reykjavik, Iceland, June 20-23, 2017},
pages = {1--12},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/LICS.2017.8005068},
doi = {10.1109/LICS.2017.8005068},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/BlondinH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/BlondinEJM17,
author = {Michael Blondin and
Javier Esparza and
Stefan Jaax and
Philipp J. Meyer},
editor = {Elad Michael Schiller and
Alexander A. Schwarzmann},
title = {Towards Efficient Verification of Population Protocols},
booktitle = {Proceedings of the {ACM} Symposium on Principles of Distributed Computing,
{PODC} 2017, Washington, DC, USA, July 25-27, 2017},
pages = {423--430},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3087801.3087816},
doi = {10.1145/3087801.3087816},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/BlondinEJM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BlondinJEM17,
author = {Michael Blondin and
Stefan Jaax and
Javier Esparza and
Philipp J. Meyer},
title = {Towards Efficient Verification of Population Protocols},
journal = {CoRR},
volume = {abs/1703.04367},
year = {2017},
url = {http://arxiv.org/abs/1703.04367},
eprinttype = {arXiv},
eprint = {1703.04367},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BlondinJEM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-07258,
author = {Michael Blondin and
Alain Finkel and
Jean Goubault{-}Larrecq},
title = {Forward Analysis for WSTS, Part {III:} Karp-Miller Trees},
journal = {CoRR},
volume = {abs/1710.07258},
year = {2017},
url = {http://arxiv.org/abs/1710.07258},
eprinttype = {arXiv},
eprint = {1710.07258},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-07258.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/hal/Blondin16,
author = {Michael Blondin},
title = {Algorithmique et complexit{\'{e}} des syst{\`{e}}mes {\`{a}}
compteurs. (Algorithmics and complexity of counter machines)},
school = {University of Paris-Saclay, France},
year = {2016},
url = {https://tel.archives-ouvertes.fr/tel-01359000},
timestamp = {Tue, 21 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/hal/Blondin16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BlondinKM16,
author = {Michael Blondin and
Andreas Krebs and
Pierre McKenzie},
title = {The complexity of intersecting finite automata having few final states},
journal = {Comput. Complex.},
volume = {25},
number = {4},
pages = {775--814},
year = {2016},
url = {https://doi.org/10.1007/s00037-014-0089-9},
doi = {10.1007/S00037-014-0089-9},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BlondinKM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tacas/BlondinFHH16,
author = {Michael Blondin and
Alain Finkel and
Christoph Haase and
Serge Haddad},
editor = {Marsha Chechik and
Jean{-}Fran{\c{c}}ois Raskin},
title = {Approaching the Coverability Problem Continuously},
booktitle = {Tools and Algorithms for the Construction and Analysis of Systems
- 22nd International Conference, {TACAS} 2016, Held as Part of the
European Joint Conferences on Theory and Practice of Software, {ETAPS}
2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9636},
pages = {480--496},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-49674-9\_28},
doi = {10.1007/978-3-662-49674-9\_28},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/tacas/BlondinFHH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BlondinFM16,
author = {Michael Blondin and
Alain Finkel and
Pierre McKenzie},
title = {Well Behaved Transition Systems},
journal = {CoRR},
volume = {abs/1608.02636},
year = {2016},
url = {http://arxiv.org/abs/1608.02636},
eprinttype = {arXiv},
eprint = {1608.02636},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BlondinFM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/BlondinFGHM15,
author = {Michael Blondin and
Alain Finkel and
Stefan G{\"{o}}ller and
Christoph Haase and
Pierre McKenzie},
title = {Reachability in Two-Dimensional Vector Addition Systems with States
Is PSPACE-Complete},
booktitle = {30th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}
2015, Kyoto, Japan, July 6-10, 2015},
pages = {32--43},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/LICS.2015.14},
doi = {10.1109/LICS.2015.14},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/BlondinFGHM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BlondinFHH15,
author = {Michael Blondin and
Alain Finkel and
Christoph Haase and
Serge Haddad},
title = {Approaching the Coverability Problem Continuously},
journal = {CoRR},
volume = {abs/1510.05724},
year = {2015},
url = {http://arxiv.org/abs/1510.05724},
eprinttype = {arXiv},
eprint = {1510.05724},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BlondinFHH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BlondinFM14,
author = {Michael Blondin and
Alain Finkel and
Pierre McKenzie},
editor = {Javier Esparza and
Pierre Fraigniaud and
Thore Husfeldt and
Elias Koutsoupias},
title = {Handling Infinitely Branching {WSTS}},
booktitle = {Automata, Languages, and Programming - 41st International Colloquium,
{ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
{II}},
series = {Lecture Notes in Computer Science},
volume = {8573},
pages = {13--25},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-43951-7\_2},
doi = {10.1007/978-3-662-43951-7\_2},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BlondinFM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BlondinFGHM14,
author = {Michael Blondin and
Alain Finkel and
Stefan G{\"{o}}ller and
Christoph Haase and
Pierre McKenzie},
title = {Reachability in Two-Dimensional Vector Addition Systems with States
is PSPACE-complete},
journal = {CoRR},
volume = {abs/1412.4259},
year = {2014},
url = {http://arxiv.org/abs/1412.4259},
eprinttype = {arXiv},
eprint = {1412.4259},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BlondinFGHM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/BlondinM12,
author = {Michael Blondin and
Pierre McKenzie},
editor = {Edward A. Hirsch and
Juhani Karhum{\"{a}}ki and
Arto Lepist{\"{o}} and
Michail Kh. Prilutskii},
title = {The Complexity of Intersecting Finite Automata Having Few Final States},
booktitle = {Computer Science - Theory and Applications - 7th International Computer
Science Symposium in Russia, {CSR} 2012, Nizhny Novgorod, Russia,
July 3-7, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7353},
pages = {31--42},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30642-6\_4},
doi = {10.1007/978-3-642-30642-6\_4},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/csr/BlondinM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BlondinKM12,
author = {Michael Blondin and
Andreas Krebs and
Pierre McKenzie},
title = {The Complexity of Intersecting Finite Automata Having Few Final States},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-090}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/090},
eprinttype = {ECCC},
eprint = {TR12-090},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BlondinKM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-05-09 00:11 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:
