Reachability in Register Machines with Polynomial Updates
This paper introduces a class of register machines whose registers can be updated by polynomial functions when a transition is taken, and the domain of the registers can be constrained by linear constraints. This model strictly generalises a variety of known formalisms such as various classes of Vector Addition Systems with States. Our main result is that reachability in our class is PSPACE-complete when restricted to one register. We moreover give a classification of the complexity of reachability according to the type of polynomials allowed and the geometry induced by the range-constraining formula.
KeywordsResidue Class Chinese Remainder Theorem Reachability Problem Prime Number Theorem Register Machine
Unable to display preview. Download preview PDF.
- 1.Babić, D., Cook, B., Hu, A.J., Rakamarić, Z.: Proving termination of nonlinear command sequences. Formal Aspects of Computing, 1–15 (2012)Google Scholar
- 7.Fearnley, J., Jurdziński, M.: Reachability in two-clock timed automata is PSPACE-complete. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol. 7966, pp. 212–223. Springer, Heidelberg (2013)Google Scholar
- 9.Fremont, D.: The reachability problem for affine functions on the integers (2012), http://web.mit.edu/~dfremont/www/reachability.pdf
- 11.Haase, C.: On the Complexity of Model Checking Counter Automata. PhD thesis, University of Oxford, UK (2012)Google Scholar
- 16.Lipton, R.: The reachability problem is exponential-space-hard. Technical report, Yale University, New Haven, CT (1976)Google Scholar
- 17.Mayr, E.W.: An algorithm for the general Petri net reachability problem. In: Proc. STOC, pp. 238–246. ACM, New York (1981)Google Scholar
- 19.Reichert, J.: Personal communication (2013)Google Scholar