59 citations · 220 across the 25 of their papers we have counts for
6 papers · 1 filter
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…
The Reachability Problem for Petri Nets is Not Elementary
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic +2
Petri nets, also known as vector addition systems, are a long established model of concurrency with extensive applications in modelling and analysis of hardware, software and datab…
Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms
Lorenzo Clemente, Sławomir Lasota
We study an expressive model of timed pushdown automata extended with modular and fractional clock constraints. We show that the binary reachability relation is effectively express…
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…