Piotr Hofman

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 42

Top Topics

Schema Mappings

Linear Equations

Top Venues

Publications

Michael Blondin, Alain Finkel, Piotr Hofman, Filip Mazowiecki, Philip Offtermatt
Soundness of reset workflow nets. LICS (2024)
Arka Ghosh, Piotr Hofman, Slawomir Lasota
Orbit-finite linear programming. LICS (2023)
Arka Ghosh, Piotr Hofman, Slawomir Lasota
Orbit-finite linear programming. CoRR (2023)
Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Filip Mazowiecki, Henry Sinclair-Banks
Acyclic Petri and Workflow Nets with Resets. FSTTCS (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)
Arka Ghosh, Piotr Hofman, Slawomir Lasota
Solvability of orbit-finite systems of linear equations. CoRR (2022)
Arka Ghosh, Piotr Hofman, Slawomir Lasota
Solvability of orbit-finite systems of linear equations. LICS (2022)
Wojciech Czerwinski, Piotr Hofman
Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable. CoRR (2022)
Wojciech Czerwinski, Piotr Hofman
Language Inclusion for Boundedly-Ambiguous Vector Addition Systems Is Decidable. CONCUR (2022)
Piotr Hofman, Jakub Rózycki
Linear equations for unordered data vectors in $[D]^k\to{}Z^d$. Log. Methods Comput. Sci. 18 (4) (2022)
Piotr Hofman, Marta Juzepczuk, Slawomir Lasota, Mohnish Pattathurajan
Parikh's theorem for infinite alphabets. CoRR (2021)
Piotr Hofman, Jakub Rózycki
Linear equations for unordered data vectors. CoRR (2021)
Piotr Hofman, Marta Juzepczuk, Slawomir Lasota, Mohnish Pattathurajan
Parikh's theorem for infinite alphabets. LICS (2021)
Michal Skrzypczak, Piotr Hofman
Preface. Fundam. Informaticae 180 (4) (2021)
Matthias Englert, Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Juliusz Straszynski
A lower bound for the coverability problem in acyclic pushdown VAS. Inf. Process. Lett. 167 (2021)
Wojciech Czerwinski, Diego Figueira, Piotr Hofman
Universality Problem for Unambiguous VASS. CONCUR (2020)
Shaull Almagor, Udi Boker, Piotr Hofman, Patrick Totzke
Parametrized Universality Problems for One-Counter Nets. CoRR (2020)
Wojciech Czerwinski, Diego Figueira, Piotr Hofman
Universality Problem for Unambiguous VASS. CoRR (2020)
Shaull Almagor, Udi Boker, Piotr Hofman, Patrick Totzke
Parametrized Universality Problems for One-Counter Nets. CONCUR (2020)
Utkarsh Gupta, Preey Shah, S. Akshay, Piotr Hofman
Continuous Reachability for Unordered Data Petri nets is in PTime. CoRR (2019)
Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar
Shortest paths in one-counter systems. Log. Methods Comput. Sci. 15 (1) (2019)
Utkarsh Gupta, Preey Shah, S. Akshay, Piotr Hofman
Continuous Reachability for Unordered Data Petri Nets is in PTime. FoSSaCS (2019)
Lorenzo Clemente, Piotr Hofman, Patrick Totzke
Timed Basic Parallel Processes. CONCUR (2019)
Lorenzo Clemente, Piotr Hofman, Patrick Totzke
Timed Basic Parallel Processes. CoRR (2019)
Piotr Hofman, Slawomir Lasota
Linear Equations with Ordered Data. CoRR (2018)
Wojciech Czerwinski, Piotr Hofman, Georg Zetzsche
Unboundedness Problems for Languages of Vector Addition Systems. ICALP (2018)
Piotr Hofman, Slawomir Lasota
Linear Equations with Ordered Data. CONCUR (2018)
Wojciech Czerwinski, Piotr Hofman, Georg Zetzsche
Unboundedness problems for languages of vector addition systems. CoRR (2018)
Piotr Hofman, Patrick Totzke
Trace inclusion for one-counter nets revisited. Theor. Comput. Sci. 735 (2018)
Piotr Hofman, Jérôme Leroux, Patrick Totzke
Linear combinations of unordered data vectors. LICS (2017)
Stanislav Böhm, Stefan Göller, Simon Halfon, Piotr Hofman
On Büchi One-Counter Automata. STACS (2017)
Patricia Bouyer, Piotr Hofman, Nicolas Markey, Mickael Randour, Martin Zimmermann
Bounding Average-Energy Games. FoSSaCS (2017)
Mohamed Faouzi Atig, Dmitry Chistikov, Piotr Hofman, K. Narayan Kumar, Prakash Saivasan, Georg Zetzsche
The complexity of regular abstractions of one-counter languages. LICS (2016)
Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Sylvain Schmitz, Patrick Totzke
Coverability Trees for Petri Nets with Unordered Data. FoSSaCS (2016)
Mohamed Faouzi Atig, Dmitry Chistikov, Piotr Hofman, K. Narayan Kumar, Prakash Saivasan, Georg Zetzsche
Complexity of regular abstractions of one-counter languages. CoRR (2016)
Diego Figueira, Piotr Hofman, Slawomir Lasota
Relating timed and register automata. Math. Struct. Comput. Sci. 26 (6) (2016)
Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke
Simulation Problems Over One-Counter Nets. Log. Methods Comput. Sci. 12 (1) (2016)
Piotr Hofman, Jérôme Leroux, Patrick Totzke
Linear Combinations of Unordered Data Vectors. CoRR (2016)
Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar
Shortest Paths in One-Counter Systems. FoSSaCS (2016)
Christoph Haase, Piotr Hofman
Tightening the Complexity of Equivalence Problems for Commutative Grammars. STACS (2016)
Patricia Bouyer, Piotr Hofman, Nicolas Markey, Mickael Randour, Martin Zimmermann
Bounding Average-energy Games. CoRR (2016)
Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar
Shortest paths in one-counter systems. CoRR (2015)
Stanislav Böhm, Stefan Haar, Serge Haddad, Piotr Hofman, Stefan Schwoon
Active diagnosis with observable quiescence. CDC (2015)
Christoph Haase, Piotr Hofman
Tightening the Complexity of Equivalence Problems for Commutative Grammars. CoRR (2015)
Piotr Hofman, Wim Martens
Separability by Short Subsequences and Subwords. ICDT (2015)
Piotr Hofman, Patrick Totzke
Trace Inclusion for One-Counter Nets Revisited. CoRR (2014)
Claire David, Piotr Hofman, Filip Murlak, Michal Pilipczuk
Synthesizing transformations from XML schema mappings. ICDT (2014)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofman, Richard Mayr, K. Narayan Kumar, Patrick Totzke
Infinite-state energy games. CSL-LICS (2014)
Piotr Hofman, Patrick Totzke
Trace Inclusion for One-Counter Nets Revisited. RP (2014)
Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota
Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes. Theory Comput. Syst. 55 (1) (2014)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofman, Richard Mayr, K. Narayan Kumar, Patrick Totzke
Infinite-State Energy Games. CoRR (2014)
Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke
Simulation Over One-counter Nets is PSPACE-Complete. CoRR (2013)
Piotr Hofman, Richard Mayr, Patrick Totzke
Decidability of Weak Simulation on One-Counter Nets. LICS (2013)
Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke
Simulation Over One-counter Nets is PSPACE-Complete. FSTTCS (2013)
Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota
Reachability Problem for Weak Multi-Pushdown Automata. Log. Methods Comput. Sci. 9 (3) (2013)
Piotr Hofman, Richard Mayr, Patrick Totzke
Decidability of Weak Simulation on One-counter Nets CoRR (2013)
Piotr Hofman, Patrick Totzke
Approximating Weak Bisimilarity of Basic Parallel Processes EXPRESS/SOS (2012)
Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota
Reachability Problem for Weak Multi-Pushdown Automata. CONCUR (2012)
Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota
Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes. CONCUR (2011)
Diego Figueira, Piotr Hofman, Slawomir Lasota
Relating timed and register automata EXPRESS (2010)