skip to main content
research-article
Open Access

Deciding ω-regular properties on linear recurrence sequences

Published:04 January 2021Publication History
Skip Abstract Section

Abstract

We consider the problem of deciding ω-regular properties on infinite traces produced by linear loops. Here we think of a given loop as producing a single infinite trace that encodes information about the signs of program variables at each time step. Formally, our main result is a procedure that inputs a prefix-independent ω-regular property and a sequence of numbers satisfying a linear recurrence, and determines whether the sign description of the sequence (obtained by replacing each positive entry with “+”, each negative entry with “−”, and each zero entry with “0”) satisfies the given property. Our procedure requires that the recurrence be simple, i.e., that the update matrix of the underlying loop be diagonalisable. This assumption is instrumental in proving our key technical lemma: namely that the sign description of a simple linear recurrence sequence is almost periodic in the sense of Muchnik, Sem'enov, and Ushakov. To complement this lemma, we give an example of a linear recurrence sequence whose sign description fails to be almost periodic. Generalising from sign descriptions, we also consider the verification of properties involving semi-algebraic predicates on program variables.

References

  1. Manindra Agrawal, S. Akshay, Blaise Genest, and P. S. Thiagarajan. 2015. Approximate Verification of the Symbolic Dynamics of Markov Chains. J. ACM 62, 1 ( 2015 ), 2 : 1-2 : 34.Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Dana Angluin and Dana Fisman. 2020. Regular omega-languages With an Informative Right Congruence. Information and Computation ( 2020 ). https://doi.org/10.1016/j.ic. 2020.104598 Google ScholarGoogle ScholarCross RefCross Ref
  3. P. T. Bateman, C. G. Jockusch, and A. R. Woods. 1993. Decidability and undecidability of theories with a predicate for the primes. Journal of Symbolic Logic 58, 2 ( June 1993 ), 672-687.Google ScholarGoogle ScholarCross RefCross Ref
  4. Danièle Beauquier, Alexander Moshe Rabinovich, and Anatol Slissenko. 2006. A Logic of Probability with Decidable Model Checking. J. Log. Comput. 16, 4 ( 2006 ), 461-487.Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. J. P. Bell and S. Gerhold. 2007. On the Positivity Set of a Linear Recurrence. Israel Jour. Math. 57 ( 2007 ).Google ScholarGoogle Scholar
  6. Jean Berstel and Maurice Mignotte. 1976. Deux propriétés décidables Des Suites récurrentes linéaires. Bulletin de la Societe mathematique de France 79 ( 1976 ), 175-184. https://doi.org/10.24033/bsmf.1823 Google ScholarGoogle ScholarCross RefCross Ref
  7. J. Richard Büchi. 1962. On a decision method in restricted second order arithmetic. In Logic, Methodology and Philosophy of Science (Proc. 1960 Internat. Congr.). Stanford Univ. Press, Stanford, Calif., 1-11.Google ScholarGoogle Scholar
  8. Olivier Carton and Wolfgang Thomas. 2002. The Monadic Theory of Morphic Infinite Words and Generalizations. Information and Computation 176, 1 ( 2002 ), 51-65. https://doi.org/10.1006/inco. 2001.3139 Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. John William Scott Cassels. 1957. An introduction to Diophantine approximation. Number 45. CUP Archive.Google ScholarGoogle Scholar
  10. Calvin C. Elgot and Michael O. Rabin. 1966. Decidability and Undecidability of Extensions of Second (first) Order Theory of (generalized) Successor. The Journal of Symbolic Logic 31, 02 ( 1966 ), 169-181. https://doi.org/10.2307/2269808 Google ScholarGoogle ScholarCross RefCross Ref
  11. Graham Everest, Alf van der Poorten, Igor Shparlinski, and Thomas Ward. 2003. Recurrence Sequences. https://doi.org/10. 1090/surv/104 Google ScholarGoogle ScholarCross RefCross Ref
  12. Jan-Hendrik Evertse. 1984. On sums of-units and linear recurrences. Compositio Mathematica 53, 2 ( 1984 ), 225-244. http://www.numdam.org/item/CM_1984__53_2_225_0Google ScholarGoogle Scholar
  13. Dominique Perrin Jean-eric Pin. 2004. Infinite Words-Automata, Semigroups, Logic and Games. Elsevier. nil pages. https://doi.org/10.1016/s0079-8169 ( 04 ) x8001-6 Google ScholarGoogle ScholarCross RefCross Ref
  14. Toghrul Karimov, Joel Ouaknine, and James Worrel. 2020. On LTL Model Checking for Low-Dimensional Discrete Linear Dynamical Systems. In 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, LIPIcs 170.Google ScholarGoogle Scholar
  15. Serge Lang. 1995. Introduction to Diophantine Approximations. Springer New York. https://doi.org/10.1007/978-1-4612-4220-8 Google ScholarGoogle ScholarCross RefCross Ref
  16. David W Masser. 1988. Linear relations on algebraic groups. New Advances in Transcendence Theory ( 1988 ), 248-262.Google ScholarGoogle Scholar
  17. Marston Morse and Gustav A. Hedlund. 1938. Symbolic Dynamics. American Journal of Mathematics 60, 4 ( 1938 ), 815. https://doi.org/10.2307/2371264 Google ScholarGoogle ScholarCross RefCross Ref
  18. An. Muchnik, A. Semenov, and M. Ushakov. 2003. Almost Periodic Sequences. Theoretical Computer Science 304, 1-3 ( 2003 ), 1-33. https://doi.org/10.1016/s0304-3975 ( 02 ) 00847-2 Google ScholarGoogle ScholarCross RefCross Ref
  19. Joël Ouaknine and James Worrell. 2013. Positivity Problems for Low-Order Linear Recurrence Sequences. In Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. https://doi.org/10.1137/1.9781611973402.27 Google ScholarGoogle ScholarCross RefCross Ref
  20. Joël Ouaknine and James Worrell. 2014a. On the Positivity Problem for Simple Linear Recurrence Sequences. In Automata, Languages, and Programming-41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II (Lecture Notes in Computer Science, Vol. 8573 ), Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, and Elias Koutsoupias (Eds.). Springer, 318-329.Google ScholarGoogle Scholar
  21. Joël Ouaknine and James Worrell. 2014b. Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences. In Automata, Languages, and Programming-41st International Colloquium, ICALP 2014, Proceedings, Part II (Lecture Notes in Computer Science, Vol. 8573 ). Springer, 330-341.Google ScholarGoogle Scholar
  22. Alexander Rabinovich. 2007. On Decidability of Monadic Logic of Order Over the Naturals Extended By Monadic Predicates. Information and Computation 205, 6 ( 2007 ), 870-889. https://doi.org/10.1016/j.ic. 2006. 12.004 Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. A. Salomaa and M. Soittola. 1978. Automata-theoretic aspects of formal power series. Springer.Google ScholarGoogle Scholar
  24. A L Semënov. 1984. Logical Theories of One-Place Functions on the Set of Natural Numbers. Mathematics of the USSR-Izvestiya 22, 3 ( 1984 ), 587-618. https://doi.org/10.1070/im1984v022n03abeh001456 Google ScholarGoogle ScholarCross RefCross Ref
  25. Harold N. Shapiro. 1959. On a Theorem Concerning Exponential Polynomials. Communications on Pure and Applied Mathematics 12, 3 ( 1959 ), 487-500. https://doi.org/10.1002/cpa.3160120306 Google ScholarGoogle ScholarCross RefCross Ref
  26. Alfred Tarski. 1951. A decision method for elementary algebra and geometry. ( 1951 ).Google ScholarGoogle Scholar
  27. R. Tijdeman, M. Mignotte, and T.N. Shorey. 1984. The Distance Between Terms of an Algebraic Recurrence Sequence. Journal für die reine und angewandte Mathematik (Crelles Journal) 1984, 349 ( 1984 ), 63-76. https://doi.org/10.1515/crll. 1984. 349.63 Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Deciding ω-regular properties on linear recurrence sequences

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!