Linear combinations of unordered data vectors

Data vectors generalise finite multisets: they are finitely supported functions into a commutative monoid. We study the question whether a given data vector can be expressed as a finite sum of others, only assuming that 1) the domain is countable and 2) the given set of base vectors is finite up to permutations of the domain.

[1]  Jan Sürmeli,et al.  Homogeneous Equations of Algebraic Petri Nets , 2016, CONCUR.

[2]  Alain Finkel,et al.  Approaching the Coverability Problem Continuously , 2016, TACAS.

[3]  Slawomir Lasota,et al.  Automata theory in nominal sets , 2014, Log. Methods Comput. Sci..

[4]  Fernando Rosa-Velardo,et al.  Accelerations for the Coverability Set of Petri Nets with Names , 2011, Fundam. Informaticae.

[5]  Harry Kesten,et al.  Making money in fair games , 1991 .

[6]  Serge Haddad,et al.  Algebraic structure of flows of a regular coloured net , 1986, European Workshop on Applications and Theory of Petri Nets.

[7]  Kurt Jensen,et al.  Coloured Petri Nets , 1996, Monographs in Theoretical Computer Science. An EATCS Series.

[8]  Charles Rackoff,et al.  The Covering and Boundedness Problems for Vector Addition Systems , 1978, Theor. Comput. Sci..

[9]  Ernst W. Mayr.  An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..

[10]  Fernando Rosa-Velardo,et al.  Decidability and complexity of Petri nets with unordered data , 2011, Theor. Comput. Sci..

[11]  Jörg Desel,et al.  Free choice Petri nets , 1995 .

[12]  Philippe Schnoebelen,et al.  Reset Nets Between Decidability and Undecidability , 1998, ICALP.

[13]  Wolfgang Reisig,et al.  Petri Nets and Algebraic Specifications , 1991, Theor. Comput. Sci..

[14]  Rupak Majumdar,et al.  An SMT-Based Approach to Coverability Analysis , 2014, CAV.

[15]  Thomas Wahl,et al.  Unbounded-Thread Program Verification using Thread-State Equations , 2016, IJCAR.

[16]  Wolfgang Reisig,et al.  Lectures on Petri Nets I: Basic Models , 1996, Lecture Notes in Computer Science.

[17]  Christoph Haase,et al.  Integer Vector Addition Systems with States , 2014, RP.

[18]  Sami Evangelista,et al.  A Simple Positive Flows Computation Algorithm for a Large Subclass of Colored Nets , 2007, FORTE.

[19]  Parosh Aziz Abdulla,et al.  Algorithmic Analysis of Programs with Well Quasi-ordered Domains , 2000, Inf. Comput..

[20]  Parosh Aziz Abdulla,et al.  A classification of the expressive power of well-structured transition systems , 2011, Inf. Comput..

[21]  Manuel Silva Suárez,et al.  Linear Algebraic and Linear Programming Techniques for the Analysis of Place or Transition Net Systems , 1996, Petri Nets.

[22]  Richard M. Karp,et al.  Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[23]  T. Murata.  State equation, controllability, and maximal matchings of petri nets , 1977 .

[24]  Slawomir Lasota,et al.  Turing Machines with Atoms , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[25]  Bengt Aspvall,et al.  Khachiyan's Linear Programming Algorithm , 1980, J. Algorithms.

[26]  Joël Ouaknine,et al.  Model Checking Flat Freeze LTL on One-Counter Automata , 2016, CONCUR.

[27]  Szymon Torunczyk,et al.  Locally Finite Constraint Satisfaction Problems , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

[28]  Slawomir Lasota,et al.  Coverability Trees for Petri Nets with Unordered Data , 2016, FoSSaCS.

[29]  Serge Haddad,et al.  Complexity Analysis of Continuous Petri Nets , 2013, Fundam. Informaticae.

[30]  Philippe Schnoebelen,et al.  Well-structured transition systems everywhere! , 2001, Theor. Comput. Sci..

[31]  Sylvain Schmitz,et al.  Demystifying Reachability in Vector Addition Systems , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

[32]  Fernando Rosa-Velardo,et al.  Ordinal recursive complexity of Unordered Data Nets , 2017, Inf. Comput..

[33]  Philippe Schnoebelen,et al.  The Power of Well-Structured Systems , 2013, CONCUR.

[34]  Salman Kurtulan,et al.  Generalized state equation for Petri nets , 2011 .

[35]  Pierre Ganty,et al.  Complexity Analysis of the Backward Coverability Algorithm for VASS , 2011, RP.

[36]  Manuel Silva Suárez,et al.  Continuous Petri Nets: Expressive Power and Decidability Issues , 2007, Int. J. Found. Comput. Sci..

[37]  Karsten Wolf.  Verification of Siphons and Traps for Algebraic Petri Nets , 1997, ICATPN.

[38]  S. Rao Kosaraju,et al.  Decidability of reachability in vector addition systems (Preliminary Version) , 1982, STOC '82.

[39]  Wolfgang Reisig,et al.  Application and Theory of Petri Nets , 1982, Informatik-Fachberichte.

[40]  Sheila A. Greibach.  Remarks on Blind and Partially Blind One-Way Multicounter Machines , 1978, Theor. Comput. Sci..

[41]  Joël Ouaknine,et al.  Nets with Tokens which Carry Data , 2008, Fundam. Informaticae.

[42]  Alain Finkel,et al.  Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete , 2014, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.