Piotr Hofman

According to our database, Piotr Hofman authored at least 36 papers between 2010 and 2024.

Collaborative distances:

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

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

Orbit-finite linear programming.

Arka Ghosh, Piotr Hofman, Slawomir Lasota

Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 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

Fast Termination and Workflow Nets.

Piotr Hofman, Filip Mazowiecki, Philip Offtermatt

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

2022

Linear equations for unordered data vectors in $[D]^k\to{}Z^d$.

Piotr Hofman, Jakub Rózycki

Log. Methods Comput. Sci., 2022

Solvability of orbit-finite systems of linear equations.

Arka Ghosh, Piotr Hofman, Slawomir Lasota

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

Language Inclusion for Boundedly-Ambiguous Vector Addition Systems Is Decidable.

Wojciech Czerwinski, Piotr Hofman

Proceedings of the 33rd International Conference on Concurrency Theory, 2022

2021

A lower bound for the coverability problem in acyclic pushdown VAS.

Matthias Englert, Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Juliusz Straszynski

Inf. Process. Lett., 2021

Preface.

Michal Skrzypczak, Piotr Hofman

Fundam. Informaticae, 2021

Linear equations for unordered data vectors.

Piotr Hofman, Jakub Rózycki

CoRR, 2021

Parikh's theorem for infinite alphabets.

Piotr Hofman, Marta Juzepczuk, Slawomir Lasota, Mohnish Pattathurajan

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

2020

Universality Problem for Unambiguous VASS.

Wojciech Czerwinski, Diego Figueira, Piotr Hofman

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

Parametrized Universality Problems for One-Counter Nets.

Shaull Almagor, Udi Boker, Piotr Hofman, Patrick Totzke

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

2019

Shortest paths in one-counter systems.

Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar

Log. Methods Comput. Sci., 2019

Continuous Reachability for Unordered Data Petri Nets is in PTime.

Utkarsh Gupta, Preey Shah, S. Akshay, Piotr Hofman

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

Timed Basic Parallel Processes.

Lorenzo Clemente, Piotr Hofman, Patrick Totzke

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

2018

Trace inclusion for one-counter nets revisited.

Piotr Hofman, Patrick Totzke

Theor. Comput. Sci., 2018

Unboundedness Problems for Languages of Vector Addition Systems.

Wojciech Czerwinski, Piotr Hofman, Georg Zetzsche

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

Linear Equations with Ordered Data.

Piotr Hofman, Slawomir Lasota

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

2017

On Büchi One-Counter Automata.

Stanislav Böhm, Stefan Göller, Simon Halfon, Piotr Hofman

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Linear combinations of unordered data vectors.

Piotr Hofman, Jérôme Leroux, Patrick Totzke

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

Bounding Average-Energy Games.

Patricia Bouyer, Piotr Hofman, Nicolas Markey, Mickael Randour, Martin Zimmermann

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

2016

Simulation Problems Over One-Counter Nets.

Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke

Log. Methods Comput. Sci., 2016

Tightening the Complexity of Equivalence Problems for Commutative Grammars.

Christoph Haase, Piotr Hofman

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

The complexity of regular abstractions of one-counter languages.

Mohamed Faouzi Atig, Dmitry Chistikov, Piotr Hofman, K. Narayan Kumar, Prakash Saivasan, Georg Zetzsche

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Coverability Trees for Petri Nets with Unordered Data.

Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Sylvain Schmitz, Patrick Totzke

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

2015

Separability by Short Subsequences and Subwords.

Piotr Hofman, Wim Martens

Proceedings of the 18th International Conference on Database Theory, 2015

Active diagnosis with observable quiescence.

Stanislav Böhm, Stefan Haar, Serge Haddad, Piotr Hofman, Stefan Schwoon

Proceedings of the 54th IEEE Conference on Decision and Control, 2015

2014

Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes.

Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota

Theory Comput. Syst., 2014

Synthesizing transformations from XML schema mappings.

Claire David, Piotr Hofman, Filip Murlak, Michal Pilipczuk

Proceedings of the Proc. 17th International Conference on Database Theory (ICDT), 2014

Infinite-state energy games.

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofman, Richard Mayr, K. Narayan Kumar, Patrick Totzke

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

Reachability Problem for Weak Multi-Pushdown Automata.

Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota

Log. Methods Comput. Sci., 2013

Decidability of Weak Simulation on One-Counter Nets.

Piotr Hofman, Richard Mayr, Patrick Totzke

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Simulation Over One-counter Nets is PSPACE-Complete.

Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012

Approximating Weak Bisimilarity of Basic Parallel Processes

Piotr Hofman, Patrick Totzke

Proceedings of the Proceedings Combined 19th International Workshop on Expressiveness in Concurrency and 9th Workshop on Structured Operational Semantics, 2012

2010

Relating timed and register automata

Diego Figueira, Piotr Hofman, Slawomir Lasota

Proceedings of the Proceedings 17th International Workshop on Expressiveness in Concurrency, 2010