Filip Mazowiecki

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 59

Top Topics

Probabilistic Automata

Tree Pattern Queries

Monadic Datalog

Top Venues

Publications

Michael Blondin, Alain Finkel, Piotr Hofman, Filip Mazowiecki, Philip Offtermatt
Soundness of reset workflow nets. LICS (2024)
Ismaël Jecker, Filip Mazowiecki, David Purser
Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata. LICS (2024)
Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, Karol Wegrzycki
Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality. ICALP (2023)
Filip Mazowiecki, Henry Sinclair-Banks, Karol Wegrzycki
Coverability in 2-VASS with One Unary Counter is in NP. FoSSaCS (2023)
Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Filip Mazowiecki, Henry Sinclair-Banks
Acyclic Petri and Workflow Nets with Resets. FSTTCS (2023)
Ismaël Jecker, Filip Mazowiecki, David Purser
Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata. CoRR (2023)
Pascal Baumann, Khushraj Madnani, Filip Mazowiecki, Georg Zetzsche
Monus semantics in vector addition systems with states. CoRR (2023)
Filip Mazowiecki, Henry Sinclair-Banks, Karol Wegrzycki
Coverability in 2-VASS with One Unary Counter is in NP. CoRR (2023)
Pascal Baumann, Khushraj Madnani, Filip Mazowiecki, Georg Zetzsche
Monus Semantics in Vector Addition Systems with States. CONCUR (2023)
Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, Karol Wegrzycki
Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality. CoRR (2023)
Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Filip Mazowiecki, Henry Sinclair-Banks
Acyclic Petri and Workflow Nets with Resets. CoRR (2023)
Piotr Hofman, Filip Mazowiecki, Philip Offtermatt
Fast Termination and Workflow Nets. CAV (1) (2023)
Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt, Guillermo A. Pérez
Continuous One-counter Automata. ACM Trans. Comput. Log. 24 (1) (2023)
Lorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki, Michal Pilipczuk
On Rational Recursive Sequences. STACS (2023)
Alejandro Grez, Filip Mazowiecki, Michal Pilipczuk, Gabriele Puppis, Cristian Riveros
Dynamic Data Structures for Timed Automata Acceptance. Algorithmica 84 (11) (2022)
Wojciech Czerwinski, Engel Lefaucheux, Filip Mazowiecki, David Purser, Markus A. Whiteland
The boundedness and zero isolation problems for weighted automata over nonnegative rationals. LICS (2022)
Michael Blondin, Filip Mazowiecki, Philip Offtermatt
The complexity of soundness in workflow nets. LICS (2022)
Michael Blondin, Filip Mazowiecki, Philip Offtermatt
Verifying generalised and structural soundness of workflow nets via relaxations. CoRR (2022)
Michael Blondin, Filip Mazowiecki, Philip Offtermatt
Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations. CAV (2) (2022)
Michael Blondin, Filip Mazowiecki, Philip Offtermatt
The complexity of soundness in workflow nets. CoRR (2022)
Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote, Filip Mazowiecki
A robust class of linear recurrence sequences. Inf. Comput. 289 (Part) (2022)
Wojciech Czerwinski, Engel Lefaucheux, Filip Mazowiecki, David Purser, Markus A. Whiteland
The boundedness and zero isolation problems for weighted automata over nonnegative rationals. CoRR (2022)
Lorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki, Michal Pilipczuk
On Rational Recursive Sequences. CoRR (2022)
Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt, Guillermo A. Pérez
Continuous One-Counter Automata. CoRR (2021)
Alejandro Grez, Filip Mazowiecki, Michal Pilipczuk, Gabriele Puppis, Cristian Riveros
Dynamic Data Structures for Timed Automata Acceptance. IPEC (2021)
Floris Geerts, Filip Mazowiecki, Guillermo A. Pérez
Let's Agree to Degree: Comparing Graph Convolutional Networks in the Message-Passing Framework. ICML (2021)
Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell
When are emptiness and containment decidable for probabilistic automata? J. Comput. Syst. Sci. 119 (2021)
Agnishom Chattopadhyay, Filip Mazowiecki, Anca Muscholl, Cristian Riveros
Pumping lemmas for weighted automata. Log. Methods Comput. Sci. 17 (3) (2021)
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
The Reachability Problem for Petri Nets Is Not Elementary. J. ACM 68 (1) (2021)
Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt, Guillermo A. Pérez
Continuous One-Counter Automata. LICS (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)
Alejandro Grez, Filip Mazowiecki, Michal Pilipczuk, Gabriele Puppis, Cristian Riveros
The monitoring problem for timed automata. CoRR (2020)
Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote, Filip Mazowiecki
A Robust Class of Linear Recurrence Sequences. CSL (2020)
Shaull Almagor, Michaël Cadilhac, Filip Mazowiecki, Guillermo A. Pérez
Weak Cost Register Automata are Still Powerful. Int. J. Found. Comput. Sci. 31 (6) (2020)
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
Reachability in fixed dimension vector addition systems with states. CoRR (2020)
Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues
On Polynomial Recursive Sequences. ICALP (2020)
Agnishom Chattopadhyay, Filip Mazowiecki, Anca Muscholl, Cristian Riveros
Pumping lemmas for weighted automata. CoRR (2020)
Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues
On polynomial recursive sequences. CoRR (2020)
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
Reachability in Fixed Dimension Vector Addition Systems with States. CONCUR (2020)
Floris Geerts, Filip Mazowiecki, Guillermo A. Pérez
Let's Agree to Degree: Comparing Graph Convolutional Networks in the Message-Passing Framework. CoRR (2020)
Filip Mazowiecki, Michal Pilipczuk
Reachability for Bounded Branching VASS. CoRR (2019)
Michael Blondin, Christoph Haase, Filip Mazowiecki, Mikhail A. Raskin
Affine Extensions of Integer Vector Addition Systems with States. CoRR (2019)
Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki
Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems. ACM Trans. Comput. Log. 20 (3) (2019)
Filip Mazowiecki, Michal Pilipczuk
Reachability for Bounded Branching VASS. CONCUR (2019)
Filip Mazowiecki, Cristian Riveros
Copyless cost-register automata: Structure, expressiveness, and closure properties. J. Comput. Syst. Sci. 100 (2019)
Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote, Filip Mazowiecki
A Robust Class of Linear Recurrence Sequences. CoRR (2019)
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
The reachability problem for Petri nets is not elementary. STOC (2019)
Shaull Almagor, Michaël Cadilhac, Filip Mazowiecki, Guillermo A. Pérez
Weak Cost Register Automata are Still Powerful. CoRR (2018)
Michael Blondin, Christoph Haase, Filip Mazowiecki
Affine Extensions of Integer Vector Addition Systems with States. CONCUR (2018)
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
The Reachability Problem for Petri Nets is Not Elementary (Extended Abstract). CoRR (2018)
Filip Mazowiecki, Cristian Riveros
Pumping Lemmas for Weighted Automata. STACS (2018)
Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell
When is Containment Decidable for Probabilistic Automata?. ICALP (2018)
Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell
When is Containment Decidable for Probabilistic Automata? CoRR (2018)
Shaull Almagor, Michaël Cadilhac, Filip Mazowiecki, Guillermo A. Pérez
Weak Cost Register Automata Are Still Powerful. DLT (2018)
Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki
Timed pushdown automata and branching vector addition systems. LICS (2017)
Diego Figueira, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki, Grégoire Sutre
Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One. ICALP (2017)
Filip Mazowiecki, Filip Murlak, Adam Witkowski
Monadic Datalog and Regular Tree Pattern Queries. ACM Trans. Database Syst. 41 (3) (2016)
Filip Mazowiecki, Cristian Riveros
Copyless Cost-Register Automata: Structure, Expressiveness, and Closure Properties. STACS (2016)
Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski, Rastislav Lenhardt, Filip Mazowiecki, James Worrell
Complexity of Two-Variable Logic on Finite Trees. ACM Trans. Comput. Log. 17 (4) (2016)
Filip Mazowiecki, Joanna Ochremiak, Adam Witkowski
Eliminating Recursion from Monadic Datalog Programs on Trees. MFCS (1) (2015)
Filip Mazowiecki, Cristian Riveros
On the expressibility of copyless cost register automata. CoRR (2015)
Filip Mazowiecki, Cristian Riveros
Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata. CSL (2015)
Filip Mazowiecki, Joanna Ochremiak, Adam Witkowski
Eliminating Recursion from Monadic Datalog Programs on Trees. CoRR (2015)
Witold Charatonik, Emanuel Kieronski, Filip Mazowiecki
Decidability of weak logics with deterministic transitive closure. CSL-LICS (2014)
Filip Mazowiecki, Filip Murlak, Adam Witkowski
Monadic Datalog and Regular Tree Pattern Queries. MFCS (1) (2014)
Witold Charatonik, Emanuel Kieronski, Filip Mazowiecki
Satisfiability of the Two-Variable Fragment of First-Order Logic over Trees CoRR (2013)
Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski, Rastislav Lenhardt, Filip Mazowiecki, James Worrell
Complexity of Two-Variable Logic on Finite Trees. ICALP (2) (2013)