Filip Mazowiecki

According to our database, Filip Mazowiecki authored at least 39 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2024

On Polynomial Recursive Sequences.

Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues

Theory Comput. Syst., August, 2024

Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata.

Ismaël Jecker, Filip Mazowiecki, David Purser

Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

Soundness of reset workflow nets.

Michael Blondin, Alain Finkel, Piotr Hofman, Filip Mazowiecki, Philip Offtermatt

Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

2023

Continuous One-counter Automata.

Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt, Guillermo A. Pérez

ACM Trans. Comput. Log., January, 2023

On Rational Recursive Sequences.

Lorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki, Michal Pilipczuk

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality.

Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, Karol Wegrzycki

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Acyclic Petri and Workflow Nets with Resets.

Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Filip Mazowiecki, Henry Sinclair-Banks

Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

Coverability in 2-VASS with One Unary Counter is in NP.

Filip Mazowiecki, Henry Sinclair-Banks, Karol Wegrzycki

Proceedings of the Foundations of Software Science and Computation Structures, 2023

Monus Semantics in Vector Addition Systems with States.

Pascal Baumann, Khushraj Madnani, Filip Mazowiecki, Georg Zetzsche

Proceedings of the 34th International Conference on Concurrency Theory, 2023

Fast Termination and Workflow Nets.

Piotr Hofman, Filip Mazowiecki, Philip Offtermatt

Proceedings of the Computer Aided Verification - 35th International Conference, 2023

2022

A robust class of linear recurrence sequences.

Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote, Filip Mazowiecki

Inf. Comput., 2022

Dynamic Data Structures for Timed Automata Acceptance.

Alejandro Grez, Filip Mazowiecki, Michal Pilipczuk, Gabriele Puppis, Cristian Riveros

Algorithmica, 2022

The boundedness and zero isolation problems for weighted automata over nonnegative rationals.

Wojciech Czerwinski, Engel Lefaucheux, Filip Mazowiecki, David Purser, Markus A. Whiteland

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

The complexity of soundness in workflow nets.

Michael Blondin, Filip Mazowiecki, Philip Offtermatt

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations.

Michael Blondin, Filip Mazowiecki, Philip Offtermatt

Proceedings of the Computer Aided Verification - 34th International Conference, 2022

2021

Pumping lemmas for weighted automata.

Agnishom Chattopadhyay, Filip Mazowiecki, Anca Muscholl, Cristian Riveros

Log. Methods Comput. Sci., 2021

Affine Extensions of Integer Vector Addition Systems with States.

Michael Blondin, Christoph Haase, Filip Mazowiecki, Mikhail A. Raskin

Log. Methods Comput. Sci., 2021

When are emptiness and containment decidable for probabilistic automata?

Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell

J. Comput. Syst. Sci., 2021

The Reachability Problem for Petri Nets Is Not Elementary.

Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki

J. ACM, 2021

Let's Agree to Degree: Comparing Graph Convolutional Networks in the Message-Passing Framework.

Floris Geerts, Filip Mazowiecki, Guillermo A. Pérez

Proceedings of the 38th International Conference on Machine Learning, 2021

2020

Weak Cost Register Automata are Still Powerful.

Shaull Almagor, Michaël Cadilhac, Filip Mazowiecki, Guillermo A. Pérez

Int. J. Found. Comput. Sci., 2020

The monitoring problem for timed automata.

Alejandro Grez, Filip Mazowiecki, Michal Pilipczuk, Gabriele Puppis, Cristian Riveros

CoRR, 2020

Reachability in Fixed Dimension Vector Addition Systems with States.

Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki

Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019

Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems.

Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki

ACM Trans. Comput. Log., 2019

Copyless cost-register automata: Structure, expressiveness, and closure properties.

Filip Mazowiecki, Cristian Riveros

J. Comput. Syst. Sci., 2019

Reachability for Bounded Branching VASS.

Filip Mazowiecki, Michal Pilipczuk

Proceedings of the 30th International Conference on Concurrency Theory, 2019

2018

The Reachability Problem for Petri Nets is Not Elementary (Extended Abstract).

Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki

CoRR, 2018

Pumping Lemmas for Weighted Automata.

Filip Mazowiecki, Cristian Riveros

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

When is Containment Decidable for Probabilistic Automata?.

Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Affine Extensions of Integer Vector Addition Systems with States.

Michael Blondin, Christoph Haase, Filip Mazowiecki

Proceedings of the 29th International Conference on Concurrency Theory, 2018

2017

Timed pushdown automata and branching vector addition systems.

Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One.

Diego Figueira, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki, Grégoire Sutre

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Monadic Datalog and Regular Tree Pattern Queries.

Filip Mazowiecki, Filip Murlak, Adam Witkowski

ACM Trans. Database Syst., 2016

Complexity of Two-Variable Logic on Finite Trees.

Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski, Rastislav Lenhardt, Filip Mazowiecki, James Worrell

ACM Trans. Comput. Log., 2016

2015

On the expressibility of copyless cost register automata.

Filip Mazowiecki, Cristian Riveros

CoRR, 2015

Eliminating Recursion from Monadic Datalog Programs on Trees.

Filip Mazowiecki, Joanna Ochremiak, Adam Witkowski

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata.

Filip Mazowiecki, Cristian Riveros

Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014

Decidability of weak logics with deterministic transitive closure.

Witold Charatonik, Emanuel Kieronski, Filip Mazowiecki

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013

Satisfiability of the Two-Variable Fragment of First-Order Logic over Trees

Witold Charatonik, Emanuel Kieronski, Filip Mazowiecki

CoRR, 2013