The reachability problem for Petri nets is not elementary

W Czerwiński, S Lasota, R Lazić, J Leroux… - Journal of the ACM …, 2020 - dl.acm.org
Petri nets, also known as vector addition systems, are a long established model of
concurrency with extensive applications in modeling and analysis of hardware, software …

A lower bound for the coverability problem in acyclic pushdown VAS

M Englert, P Hofman, S Lasota, R Lazić… - Information Processing …, 2021 - Elsevier
A lower bound for the coverability problem in acyclic pushdown VAS - ScienceDirect Skip to
main contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …

Reachability for two-counter machines with one test and one reset

A Finkel, J Leroux, G Sutre - … 2018-38th IARCS Annual Conference on …, 2018 - hal.science
We prove that the reachability relation of two-counter machines with one zero-test and one
reset is Presburger-definable and effectively computable. Our proof is based on the …

An approach to regular separability in vector addition systems

W Czerwiński, G Zetzsche - Proceedings of the 35th Annual ACM/IEEE …, 2020 - dl.acm.org
We study the problem of regular separability of languages of vector addition systems with
states (VASS). It asks whether for two given VASS languages K and L, there exists a regular …

Solvability of orbit-finite systems of linear equations

A Ghosh, P Hofman, S Lasota - Proceedings of the 37th Annual ACM …, 2022 - dl.acm.org
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 procedure …

Bi-reachability in Petri nets with data

Ł Kamiński, S Lasota - arXiv preprint arXiv:2405.16176, 2024 - arxiv.org
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 …

Reachability in One-Dimensional Pushdown Vector Addition Systems is Decidable

C Bizière, W Czerwiński - arXiv preprint arXiv:2411.02386, 2024 - arxiv.org
We consider the model of one-dimensional Pushdown Vector Addition Systems (1-PVAS), a
fundamental computational model simulating both recursive and concurrent behaviours. Our …

Continuous reachability for unordered data Petri nets is in PTime

U Gupta, P Shah, S Akshay, P Hofman - … , FOSSACS 2019, Held as Part of …, 2019 - Springer
Unordered data Petri nets (UDPN) are an extension of classical Petri nets with tokens that
carry data from an infinite domain and where transitions may check equality and disequality …

On functions weakly computable by pushdown Petri nets and related systems

J Leroux, M Praveen, P Schnoebelen… - Logical Methods in …, 2019 - lmcs.episciences.org
We consider numerical functions weakly computable by grammar-controlled vector addition
systems (GVASes, a variant of pushdown Petri nets). GVASes can weakly compute all fast …

Linear equations for unordered data vectors in

P Hofman, J Różycki - Logical Methods in Computer Science, 2022 - lmcs.episciences.org
Following a recently considered generalisation of linear equations to unordered-data
vectors and to ordered-data vectors, we perform a further generalisation to data vectors that …