Linear equations for unordered data vectors in $[D]^k\to{}Z^d

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 are functions from k-element subsets of the unordered-data set to vectors of integer numbers. These generalised equations...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Logical methods in computer science Jg. 18, Issue 4
Hauptverfasser:	Hofman, Piotr, Różycki, Jakub
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Logical Methods in Computer Science e.V 12.12.2022
Schlagworte:	68q85 computer science - computational complexity computer science - formal languages and automata theory computer science - symbolic computation f.3.1 f.4.2 g.2.2
ISSN:	1860-5974, 1860-5974
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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 are functions from k-element subsets of the unordered-data set to vectors of integer numbers. These generalised equations naturally appear in the analysis of vector addition systems (or Petri nets) extended so that each token carries a set of unordered data. We show that nonnegative-integer solvability of linear equations is in nondeterministic exponential time while integer solvability is in polynomial time.
ISSN:	1860-5974 1860-5974
DOI:	10.46298/lmcs-18(4:11)2022