The reachability problem for Petri nets is not elementary
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 …
concurrency with extensive applications in modeling and analysis of hardware, software …
A lower bound for the coverability problem in acyclic pushdown VAS
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 …
main contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …
Reachability for two-counter machines with one test and one reset
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 …
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 …
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
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 …
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 …
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 …
fundamental computational model simulating both recursive and concurrent behaviours. Our …
Continuous reachability for unordered data Petri nets is in PTime
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 …
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
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 …
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 …
vectors and to ordered-data vectors, we perform a further generalisation to data vectors that …