On selective unboundedness of VASS

  • Authors:

  • StéPhane Demri

  • Affiliations:

  • LSV, ENS Cachan, CNRS, INRIA, France

  • Venue:
  • Journal of Computer and System Sciences
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Numerous properties of vector addition systems with states amount to checking the (un)boundedness of some selective feature (e.g., number of reversals, counter values, run lengths). Some of these features can be checked in exponential space by using Rackoff@?@?s proof or its variants, combined with Savitch@?s Theorem. However, the question is still open for many others, e.g., regularity detection problem and reversal-boundedness detection problem. In the paper, we introduce the class of generalized unboundedness properties that can be verified in exponential space by extending Rackoff@?@?s technique, sometimes in an unorthodox way. We obtain new optimal upper bounds, for example for place boundedness problem, reversal-boundedness detection (several variants are present in the paper), strong promptness detection problem and regularity detection. Our analysis is sufficiently refined so as to obtain a polynomial-space bound when the dimension is fixed.