Relating timed and register automata - Diego Figueira; Piotr Hofman; Slawomir Lasota 001 (EXPRESS, 2010)

Approximating Weak Bisimilarity of Basic Parallel Processes - Piotr Hofman; Patrick Totzke (EXPRESS/SOS, 2012)

Simulation Over One-counter Nets is PSPACE-Complete. - Piotr Hofman; Slawomir Lasota 001; Richard Mayr; Patrick Totzke (FSTTCS, 2013)

Decidability of Weak Simulation on One-Counter Nets. - Piotr Hofman; Richard Mayr; Patrick Totzke (LICS, 2013)

Reachability Problem for Weak Multi-Pushdown Automata. - Wojciech Czerwinski; Piotr Hofman; Slawomir Lasota 001 (Log. Methods Comput. Sci., 2013)

Infinite-state energy games. - Parosh Aziz Abdulla; Mohamed Faouzi Atig; Piotr Hofman; Richard Mayr; K. Narayan Kumar; Patrick Totzke (CSL-LICS, 2014)

Synthesizing transformations from XML schema mappings. - Claire David; Piotr Hofman; Filip Murlak; Michal Pilipczuk (ICDT, 2014)

Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes. - Wojciech Czerwinski; Piotr Hofman; Slawomir Lasota 001 (Theory Comput. Syst., 2014)

Active diagnosis with observable quiescence. - Stanislav Böhm; Stefan Haar; Serge Haddad; Piotr Hofman; Stefan Schwoon (CDC, 2015)

Separability by Short Subsequences and Subwords. - Piotr Hofman; Wim Martens (ICDT, 2015)

Coverability Trees for Petri Nets with Unordered Data. - Piotr Hofman; Slawomir Lasota 001; Ranko Lazic 001; Jérôme Leroux; Sylvain Schmitz; Patrick Totzke (FoSSaCS, 2016)

The complexity of regular abstractions of one-counter languages. - Mohamed Faouzi Atig; Dmitry Chistikov 001; Piotr Hofman; K. Narayan Kumar; Prakash Saivasan; Georg Zetzsche (LICS, 2016)

Tightening the Complexity of Equivalence Problems for Commutative Grammars. - Christoph Haase; Piotr Hofman (STACS, 2016)

Simulation Problems Over One-Counter Nets. - Piotr Hofman; Slawomir Lasota 001; Richard Mayr; Patrick Totzke (Log. Methods Comput. Sci., 2016)

Bounding Average-Energy Games. - Patricia Bouyer; Piotr Hofman; Nicolas Markey; Mickael Randour; Martin Zimmermann 002 (FoSSaCS, 2017)

Linear combinations of unordered data vectors. - Piotr Hofman; Jérôme Leroux; Patrick Totzke (LICS, 2017)

On Büchi One-Counter Automata. - Stanislav Böhm; Stefan Göller; Simon Halfon; Piotr Hofman (STACS, 2017)

Linear Equations with Ordered Data. - Piotr Hofman; Slawomir Lasota 001 (CONCUR, 2018)

Unboundedness Problems for Languages of Vector Addition Systems. - Wojciech Czerwinski; Piotr Hofman; Georg Zetzsche (ICALP, 2018)

Trace inclusion for one-counter nets revisited. - Piotr Hofman; Patrick Totzke (Theor. Comput. Sci., 2018)

Timed Basic Parallel Processes. - Lorenzo Clemente; Piotr Hofman; Patrick Totzke (CONCUR, 2019)

Continuous Reachability for Unordered Data Petri Nets is in PTime. - Utkarsh Gupta; Preey Shah; S. Akshay 001; Piotr Hofman (FoSSaCS, 2019)

Shortest paths in one-counter systems. - Dmitry Chistikov 001; Wojciech Czerwinski; Piotr Hofman; Michal Pilipczuk; Michael Wehar (Log. Methods Comput. Sci., 2019)

Parametrized Universality Problems for One-Counter Nets. - Shaull Almagor; Udi Boker; Piotr Hofman; Patrick Totzke (CONCUR, 2020)

Universality Problem for Unambiguous VASS. - Wojciech Czerwinski; Diego Figueira; Piotr Hofman (CONCUR, 2020)

Parikh's theorem for infinite alphabets. - Piotr Hofman; Marta Juzepczuk; Slawomir Lasota 001; Mohnish Pattathurajan (LICS, 2021)

Linear equations for unordered data vectors. - Piotr Hofman; Jakub Rózycki (CoRR, 2021)

Preface. - Michal Skrzypczak; Piotr Hofman (Fundam. Informaticae, 2021)

A lower bound for the coverability problem in acyclic pushdown VAS. - Matthias Englert; Piotr Hofman; Slawomir Lasota 001; Ranko Lazic 001; Jérôme Leroux; Juliusz Straszynski (Inf. Process. Lett., 2021)

Solvability of orbit-finite systems of linear equations. - Arka Ghosh 002; Piotr Hofman; Slawomir Lasota 001 (LICS, 2022)

Linear equations for unordered data vectors in $[D]^k to{}Z^d$. - Piotr Hofman; Jakub Rózycki (Log. Methods Comput. Sci., 2022)

Fast Termination and Workflow Nets. - Piotr Hofman; Filip Mazowiecki; Philip Offtermatt (CAV (1), 2023)

Acyclic Petri and Workflow Nets with Resets. - Dmitry Chistikov 001; Wojciech Czerwinski; Piotr Hofman; Filip Mazowiecki; Henry Sinclair-Banks (FSTTCS, 2023)

Soundness of reset workflow nets. - Michael Blondin; Alain Finkel; Piotr Hofman; Filip Mazowiecki; Philip Offtermatt (LICS, 2024)

Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable. - Wojciech Czerwinski; Piotr Hofman (Log. Methods Comput. Sci., 2025)

Orbit-finite Linear Programming. - Arka Ghosh 002; Piotr Hofman; Slawomir Lasota 001 (J. ACM, 2025)