20 citations · 41 across the 31 of their papers we have counts for
4 papers · 1 filter
Linear Combinations of Unordered Data Vectors
Piotr Hofman, Jérôme Leroux, Patrick Totzke
Data vectors generalise finite multisets: they are finitely supported functions into a commutative monoid. We study the question if a given data vector can be expressed as a finite…
Simulation Problems Over One-Counter Nets
Piotr Hofman, Slawomir Lasota, Richard Mayr +1
One-counter nets (OCN) are finite automata equipped with a counter that can store non-negative integer values, and that cannot be tested for zero. Equivalently, these are exactly 1…
A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One
Stefan Göller, Christoph Haase, Ranko Lazić +1
Branching VASS (BVASS) generalise vector addition systems with states by allowing for special branching transitions that can non-deterministically distribute a counter value betwee…
Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete
Matthias Englert, Ranko Lazić, Patrick Totzke
Blondin et al. showed at LICS 2015 that two-dimensional vector addition systems with states have reachability witnesses of length exponential in the number of states and polynomial…