59 citations · 220 across the 25 of their papers we have counts for
12 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…
VASS reachability in three steps
Sławomir Lasota
This note is a product of digestion of the famous proof of decidability of the reachability problem for vector addition systems with states (VASS), as first established by Mayr in…
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…
Definable isomorphism problem
Khadijeh Keshvardoost, Bartek Klin, Sławomir Lasota +2
We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable…
WQO dichotomy for 3-graphs
Sławomir Lasota, Radosław Piórkowski
We investigate data-enriched models, like Petri nets with data, where executability of a transition is conditioned by a relation between data values involved. Decidability status o…
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…