A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
Linear Equations with Ordered Data
International Conference on Concurrency Theory
Following a recently considered generalization of linear equations to unordered data vectors, we perform a further generalization to ordered data vectors. These generalized equations naturally appear in the analysis of vector addition systems (or Petri nets) extended with ordered data. We show that nonnegative-integer solvability of linear equations is computationally equivalent (up to an exponential blowup) to the reachability problem for (plain) vector addition systems. This high complexitydoi:10.4230/lipics.concur.2018.24 dblp:conf/concur/HofmanL18 fatcat:wbbr3p5nerhw7p3hrstmyqncgu