Piotr Hofman

Piotr Hofman is an Assistant Professor at the Institute of Informatics, Faculty of Mathematics, Informatics and Mechanics, University of Warsaw. His research focuses on theoretical computer science, particularly automata theory, formal verification, and computational complexity related to systems with infinite alphabets and data constraints.

• PhD in Computer Science (2014) from the University of Warsaw under Sławomir Lasota.
• Postdoc (2013-2014) at University of Bayreuth with Wim Martens.
• Postdoc (2014-2016) at LSV de Cachan with Stefan Göller.

His work explores algorithmic problems in automata over infinite alphabets, including one-counter nets, Petri nets with data, and unambiguous vector addition systems (VASS). Key contributions include decidability results for bisimulation and simulation problems, complexity bounds for equivalence checking, and novel techniques for reachability and coverability analysis.

Recent publications address orbit-finite linear equations, Parikh's theorem for infinite alphabets, and lower bounds for coverability in pushdown VAS. He has received grants like NCN UMO-2016/21/D/ST6/01368 for algebraic invariants in data nets.

He supervises research projects and collaborates with institutions in Poland, France, and India. His teaching includes concurrency theory and software engineering courses.