20 citations · 59 across the 20 of their papers we have counts for
7 papers · 1 filter
Orbit-finite linear programming
Arka Ghosh, Piotr Hofman, Sławomir Lasota
An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely many elements. We study a generalisation of linear programming whe…
Linear Equations with Ordered Data
Piotr Hofman, Sławomir Lasota
Following a recently considered generalization of linear equations to unordered data vectors, we perform a further generalization to ordered data vectors. These generalized equatio…
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…
Bounding Average-energy Games
Patricia Bouyer, Piotr Hofman, Nicolas Markey +2
We consider average-energy games, where the goal is to minimize the long-run average of the accumulated energy. While several results have been obtained on these games recently, de…
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…
Trace Inclusion for One-Counter Nets Revisited
Piotr Hofman, Patrick Totzke
One-Counter nets (OCN) consist of a nondeterministic finite control and a single integer counter that cannot be fully tested for zero. They form a natural subclass of both One-Coun…
Reachability Problem for Weak Multi-Pushdown Automata
Wojciech Czerwiński, Piotr Hofman, SŁawomir Lasota
This paper is about reachability analysis in a restricted subclass of multi-pushdown automata. We assume that the control states of an automaton are partially ordered, and all tran…