The complexity of reachability in vector addition systems

The program of the 30th Symposium on Logic in Computer Science held in 2015 in Kyoto included two contributions on the computational complexity of the reachability problem for vector addition systems: Blondin, Finkel, Göller, Haase, and McKenzie [2015] attacked the problem by providing the first tight complexity bounds in the case of dimension 2 systems with states, while Leroux and Schmitz [2015] proved the first complexity upper bound in the general case. The purpose of this column is to present the main ideas behind these two results, and more generally survey the current state of affairs.

[1]  C. Petri.  Kommunikation mit Automaten , 1962 .

[2]  Max I. Kanovich,et al.  Petri Nets, Horn Programs, Linear Logic and Vector Games , 1995, Ann. Pure Appl. Log..

[3]  A. Prasad Sistla,et al.  Reasoning about systems with many processes , 1992, JACM.

[4]  John E. Hopcroft,et al.  On the Reachability Problem for 5-Dimensional Vector Addition Systems , 1976, Theor. Comput. Sci..

[5]  Jean-Luc Lambert,et al.  A Structure to Decide Reachability in Petri Nets , 1992, Theor. Comput. Sci..

[6]  Jay L. Gischer.  Shuffle languages, Petri nets, and context-sensitive grammars , 1981, CACM.

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

[8]  Martin Leucker,et al.  Ordered Navigation on Multi-attributed Data Words , 2014, CONCUR.

[9]  Sylvain Schmitz,et al.  Alternating Vector Addition Systems with States , 2014, MFCS.

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

[11]  Joël Ouaknine,et al.  Reachability in Succinct and Parametric One-Counter Automata , 2009, CONCUR.

[12]  Sylvain Schmitz.  On the Computational Complexity of Dominance Links in Grammatical Formalisms , 2010, ACL.

[13]  Owen Rambow,et al.  Multiset-Valued Linear Index Grammars: Imposing Dominance Constraints on Derivations , 1994, ACL.

[14]  Petr Jancar,et al.  Decidability of a Temporal Logic Problem for Petri Nets , 1990, Theor. Comput. Sci..

[15]  Richard Mayr,et al.  Process rewrite systems , 1999, EXPRESS.

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

[17]  Ugo Montanari,et al.  Axiomatizing net computations and processes , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[18]  Stefano Crespi-Reghizzi.  Petri Nets and Szilard Languages , 1977, Inf. Control..

[19]  Rémi Bonnet,et al.  Theory of Well Structured Transition Systems and Extended Vector Addition Systems , 2012 .

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

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

[22]  Stéphane Demri.  On selective unboundedness of VASS , 2013, J. Comput. Syst. Sci..

[23]  C. Reutenauer.  The Mathematics of Petri Nets , 1990 .

[24]  Horst Müller,et al.  The reachability problem for VAS , 1984, European Workshop on Applications and Theory in Petri Nets.

[25]  Jérôme Leroux.  The General Vector Addition System Reachability Problem by Presburger Inductive Invariants , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[26]  Mogens Nielsen,et al.  Decidability Issues for Petri Nets - a survey , 1994, Bull. EATCS.

[27]  Thomas Colcombet,et al.  Generalized Data Automata and Fixpoint Logic , 2014, FSTTCS.

[28]  Jérôme Leroux,et al.  Presburger Vector Addition Systems , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[29]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[30]  Elias Tahhan-Bittar,et al.  Ordinal Recursive Bounds for Higman's Theorem , 1998, Theor. Comput. Sci..

[31]  Glynn Winskel,et al.  Completeness Results for Linear Logic on Petri Nets , 1993, Ann. Pure Appl. Log..

[32]  Michel Hack,et al.  Decidability Questions for Petri Nets , 1975, Outstanding Dissertations in the Computer Sciences.

[33]  Hsu-Chun Yen,et al.  A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets , 1991, Theor. Comput. Sci..

[34]  Sylvain Schmitz,et al.  Model Checking Coverability Graphs of Vector Addition Systems , 2011, MFCS.

[35]  John Fearnley,et al.  Reachability in two-clock timed automata is PSPACE-complete , 2013, Inf. Comput..

[36]  Sylvain Schmitz,et al.  Complexity Hierarchies beyond Elementary , 2013, TOCT.

[37]  Stéphane Demri,et al.  The Effects of Bounding Syntactic Resources on Presburger LTL , 2007, 14th International Symposium on Temporal Representation and Reasoning (TIME'07).

[38]  Thomas Schwentick,et al.  Temporal Logics on Words with Multiple Data Values , 2010, FSTTCS.

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

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

[41]  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.

[42]  Klaus Reinhardt,et al.  Reachability in Petri Nets with Inhibitor Arcs , 2008, RP.

[43]  Jérôme Leroux,et al.  Vector addition system reachability problem: a short self-contained proof , 2011, POPL '11.

[44]  Philippe Schnoebelen,et al.  Some Decidability Results for Nested Petri Nets , 1999, Ershov Memorial Conference.

[45]  Daniel Kroening,et al.  A Widening Approach to Multithreaded Program Verification , 2014, ACM Trans. Program. Lang. Syst..

[46]  Mohamed Faouzi Atig,et al.  On Yen's Path Logic for Petri Nets , 2009, Int. J. Found. Comput. Sci..

[47]  S. Wainer,et al.  Hierarchies of number-theoretic functions. I , 1970 .

[48]  Mark Kambites,et al.  Rational subsets of polycyclic monoids and valence automata , 2007, Inf. Comput..

[49]  Andreas Weiermann,et al.  A Uniform Approach to Fundamental Sequences and Hierarchies , 1994, Math. Log. Q..

[50]  Sylvain Schmitz,et al.  Non-elementary complexities for branching VASS, MELL, and extensions , 2014, CSL-LICS.

[51]  Thomas Schwentick,et al.  Two-variable logic on data words , 2011, TOCL.

[52]  Philippe Schnoebelen,et al.  Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma , 2010, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

[53]  Katalin Bimbó,et al.  The decidability of the intensional fragment of classical linear logic , 2015, Theor. Comput. Sci..

[54]  Jérôme Leroux.  Vector Addition System Reversible Reachability Problem , 2011, CONCUR.

[55]  Bruno Guillaume,et al.  Vector addition tree automata , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[56]  M. Hack,et al.  PETRI NET LANGUAGE , 1976 .

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

[58]  Zohar Manna,et al.  Proving termination with multiset orderings , 1979, CACM.

[59]  Sylvain Schmitz,et al.  Complexity Bounds for Ordinal-Based Termination , 2014, ArXiv.

[60]  Hsu-Chun Yen,et al.  Some Complexity Bounds for Problems Concerning Finite and 2-Dimensional Vector Addition Systems with States , 1986, Theor. Comput. Sci..

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

[62]  Stéphane Demri,et al.  Reasoning about Data Repetitions with Counter Systems , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[63]  Javier Esparza,et al.  Decidability and Complexity of Petri Net Problems - An Introduction , 1996, Petri Nets.

[64]  Fernando Rosa-Velardo,et al.  Multiset rewriting for the verification of depth-bounded processes with name binding , 2012, Inf. Comput..

[65]  Ranko Lazic.  The reachability problem for vector addition systems with a stack is not elementary , 2013, ArXiv.

[66]  Richard L. Tenney,et al.  The decidability of the reachability problem for vector addition systems (Preliminary Version) , 1977, STOC '77.

[67]  Hsu-Chun Yen,et al.  A Multiparameter Analysis of the Boundedness Problem for Vector Addition Systems , 1985, J. Comput. Syst. Sci..

[68]  Roland Meyer,et al.  A theory of structural stationarity in the π-Calculus , 2009, Acta Informatica.

[69]  Florent Jacquemard,et al.  FO2(<, +1, ~) on data trees, data tree automata and branching vector addition systems , 2016, Log. Methods Comput. Sci..

[70]  Rupak Majumdar,et al.  Algorithmic verification of asynchronous programs , 2010, TOPL.

[71]  Grégoire Sutre,et al.  On Flatness for 2-Dimensional Vector Addition Systems with States , 2004, CONCUR.

[72]  Grégoire Sutre,et al.  A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness , 2013, CONCUR.

[73]  Hsu-Chun Yen,et al.  A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets , 1988, Theor. Comput. Sci..