Selected publications at LSV

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.

   author = {Schmitz, Sylvain},
   DOI = {10.1145/2893582.2893585},
   journal = {SIGLOG News},
   month = jan,
   number = {1},
   pages = {3-21},
   publisher = {ACM Press},
   title = {Automata column: The~complexity of reachability in vector addition systems},
   url = {},
   volume = {3},
   year = {2016},

About LSV

Select by Year