Filip Mazowiecki Papers Slides Food Wyjazd

  • Submitted or to be submitted


    The published papers below are grouped by topics. See also my dblp.

  • Vector addition systems

    1. The Tractability Border of Reachability in Simple Vector Addition Systems with States
      2. with Dmitry Chistikov, Wojciech Czerwiński, Łukasz Orlikowski, Henry Sinclair-Banks and Karol Węgrzycki, accepted to FOCS 2024.
    2. Soundness of reset workflow nets
      3. with Michael Blondin, Alain Finkel, Piotr Hofman and Philip Offtermatt, LICS 2024.
    3. Acyclic Petri and Workflow Nets with Resets [arxiv]
      4. with Dmitry Chistikov, Wojciech Czerwiński, Piotr Hofman, and Henry Sinclair-Banks, FSTTCS 2023.
    4. Monus semantics in vector addition systems with states [arxiv]
      5. with Pascal Baumann, Khushraj Madnani and Georg Zetzsche, CONCUR 2023.
    5. Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality [arxiv]
      6. with Marvin Künnemann, Lia Schütze, Henry Sinclair-Banks and Karol Węgrzycki, ICALP 2023 (best paper award).
    6. Fast Termination and Workflow Nets [paper]
      7. with Piotr Hofman and Philip Oftermatt, CAV 2023.
    7. Coverability in 2-VASS with One Unary Counter is in NP [arxiv]
      8. with Henry Sinclair-Banks and Karol Węgrzycki, FOSSACS 2023.
    8. Verifying generalised and structural soundness of workflow nets via relaxations [arxiv]
      9. with Michael Blondin and Philip Oftermatt, CAV 2022.
    9. The complexity of soundness in workflow nets [arxiv]
      10. with Michael Blondin and Philip Oftermatt, LICS 2022.
    10. Continuous One-Counter Automata [arxiv]
      11. with Michael Blondin, Tim Leys, Philip Oftermatt and Guillermo A. Pérez, LICS 2021.
      The journal version is in ACM TOCL.
    11. Reachability in fixed dimension vector addition systems with states [arxiv]
      12. with Wojciech Czerwiński, Sławomir Lasota, Ranko Lazić and Jérôme Leroux, CONCUR 2020.
    12. Reachability for Bounded Branching VASS [arxiv]
      13. with Michał Pilipczuk, CONCUR 2019.
    13. The Reachability Problem for Petri Nets is Not Elementary [arxiv]
      14. with Wojciech Czerwiński, Sławomir Lasota, Ranko Lazić and Jérôme Leroux, STOC 2019 (best paper award).
      The journal version is in JACM.
    14. Affine Extensions of Integer Vector Addition Systems with States [arxiv]
      15. with Michael Blondin and Christoph Haase, CONCUR 2018.
      The journal version is also with Mikhail Raskin and is in LMCS.
    15. Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One [pdf]
      16. with Diego Figueira, Ranko Lazić, Jérôme Leroux and Grégoire Sutre, ICALP 2017.
    16. Timed pushdown automata and branching vector addition systems [pdf]
      17. with Lorenzo Clemente, Sławomir Lasota and Ranko Lazić, LICS 2017.
      The journal version is in ACM TOCL.

  • Weighted automata

    1. Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata [arxiv]
      2. with Ismaël Jecker and David Purser, accepted to LICS 2024.
    2. On Rational Recursive Sequences [arxiv]
      3. with Lorenzo Clemente, Maria Donten-Bury and Michał Pilipczuk, STACS 2023.
    3. The boundedness and zero isolation problems for weighted automata over nonnegative rationals [arxiv]
      4. with Wojciech Czerwiński, Engel Lefaucheux, David Purser and Markus A. Whiteland, LICS 2022.
    4. On polynomial recursive sequences [arxiv]
      5. with Michaël Cadilhac, Charles Paperman, Michał Pilipczuk and Géraud Sénizergues, ICALP 2020.
      The journal version is in TOCS.
    5. A Robust Class of Linear Recurrence Sequences [arxiv]
      6. with Corentin Barloy, Nathanaël Fijalkow and Nathan Lhote, CSL 2020.
      The journal version is in Information and Computation.
    6. Weak Cost Register Automata are Still Powerful [arxiv]
      7. with Shaull Almagor, Michaël Cadilhac and Guillermo A. Pérez, DLT 2018.
      The journal version is in IJFCS.
    7. When is Containment Decidable for Probabilistic Automata? [arxiv]
      8. with Laure Daviaud, Marcin Jurdziński, Ranko Lazić, Guillermo A. Pérez and James Worrell, ICALP 2018.
      The journal version is in JCSS.
    8. Pumping lemmas for weighted automata [pdf]
      9. with Cristian Riveros, STACS 2018.
      The journal version is also with Agnishom Chattopadhyay and Anca Muscholl and is in LMCS.
    9. Copyless Cost-Register Automata: Structure, Expressiveness, and Closure Properties [pdf][arxiv]
      10. with Cristian Riveros, STACS 2016.
      The journal version is in JCSS.
    10. Maximal partition logic: towards a logical characterization of copyless cost register automata [pdf]
      11. with Cristian Riveros, CSL 2015.

  • Database related logics

    1. Eliminating recursion from monadic datalog programs on trees [arxiv]
      2. with Joanna Ochremiak and Adam Witkowski, MFCS 2015.
    2. Monadic Datalog and Regular Tree Pattern Queries [pdf]
      3. with Filip Murlak and Adam Witkowski, MFCS 2014.
      The journal version is in ACM TODS.
    3. Decidability of weak logics with deterministic transitive closure [pdf]
      4. with Witold Charatonik and Emanuel Kieroński, CSL-LICS 2014.
    4. Complexity of Two-Variable Logic on Finite Trees [pdf]
      5. with Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski, Rastislav Lenhardt and James Worrell, ICALP 2013.
      The journal version is in ACM TOCL.

  • Other

    1. Dynamic Data Structures for Timed Automata Acceptance [arxiv]
      2. with Alejandro Grez, Michał Pilipczuk, Gabriele Puppis and Cristian Riveros, IPEC 2021.
      The journal version is in Algorithmica.
    2. Let's Agree to Degree: Comparing Graph Convolutional Networks in the Message-Passing Framework [arxiv]
      3. with Floris Geerts and Guillermo A. Pérez, ICML 2021.