3 citations · 7 across the 4 of their papers we have counts for
10 papers
Parikh's theorem for infinite alphabets
Piotr Hofman, Marta Juzepczuk, Sławomir Lasota +1
We investigate commutative images of languages recognised by register automata and grammars. Semi-linear and rational sets can be naturally extended to this setting by allowing for…
Universality Problem for Unambiguous VASS
Wojciech Czerwiński, Diego Figueira, Piotr Hofman
We study languages of unambiguous VASS, that is, Vector Addition Systems with States, whose transitions read letters from a finite alphabet, and whose acceptance condition is defin…
Parametrized Universality Problems for One-Counter Nets
Shaull Almagor, Udi Boker, Piotr Hofman +1
We study the language universality problem for One-Counter Nets, also known as 1-dimensional Vector Addition Systems with States (1-VASS), parameterized either with an initial coun…
Timed Basic Parallel Processes
Lorenzo Clemente, Piotr Hofman, Patrick Totzke
Timed basic parallel processes (TBPP) extend communication-free Petri nets (aka. BPP or commutative context-free grammars) by a global notion of time. TBPP can be seen as an extens…
Continuous Reachability for Unordered Data Petri nets is in PTime
Utkarsh Gupta, Preey Shah, S. Akshay +1
Unordered data Petri nets (UDPN) are an extension of classical Petri nets with tokens that carry data from an infinite domain and where transitions may check equality and disequali…
Unboundedness problems for languages of vector addition systems
Wojciech Czerwiński, Piotr Hofman, Georg Zetzsche
A vector addition system (VAS) with an initial and a final marking and transition labels induces a language. In part because the reachability problem in VAS remains far from being…