59 citations · 220 across the 25 of their papers we have counts for
37 papers
Bi-reachability in Petri nets with data
Łukasz Kamiński, Sławomir Lasota
We investigate Petri nets with data, an extension of plain Petri nets where tokens carry values from an infinite data domain, and executability of transitions is conditioned by equ…
Separability and Non-Determinizability of WSTS
Wojciech Czerwiński, Eren Keskin, Sławomir Lasota +4
We study the languages recognized by well-structured transition systems (WSTS) with upward and downward compatibility. Our first result shows that every pair of disjoint WSTS langu…
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…
Solvability of orbit-finite systems of linear equations
Arka Ghosh, Piotr Hofman, Sławomir Lasota
We study orbit-finite systems of linear equations, in the setting of sets with atoms. Our principal contribution is a decision procedure for solvability of such systems. The proced…
Improved Ackermannian lower bound for the Petri nets reachability problem
Sławomir Lasota
Petri nets, equivalently presentable as vector addition systems with states, are an established model of concurrency with widespread applications. The reachability problem, where w…
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…