Skip to main content
SpringerLink
Log in

Upper Bounds for a Theory of Queues

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2719))

Included in the following conference series:

Abstract

We prove an upper bound result for the first-order theory of a structure W of queues, i.e. words with two relations: addition of a letter on the left and on the right of a word. Using complexity-tailored Ehrenfeucht games we show that the witnesses for quantified variables in this theory can be bound by words of an exponential length. This result, together with a lower bound result for the first-order theory of two successors [6], proves that the first-order theory of W is complete in LATIME(2O(n)): the class of problems solvable by alternating Turing machines runningin exponential time but only with a linear number of alternations.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Benedikt, L. Libkin, T. Schwentick, and L. Segoufin. A model-theoretic approach to regular string relations. In Proc. 16th Annual IEEE Symposium on Logic in Computer Science, LICS 2001, pages 431–440, 2001.

    Google Scholar 

  2. N.S. Bjørner. Integrating Decision Procedures for Temporal Verification. PhD thesis, Computer Science Department, Stanford University, 1998.

    Google Scholar 

  3. N.S. Bjørner. Reactive verification with queues. In ARO/ONR/NSF/DARPA Workshop on Engineering Automation for Computer-Based Systems, pages 1–8, Carmel, CA, 1998.

    Google Scholar 

  4. A. Blumensath and E. Grädel. Automatic structures. In Proc. 15th Annual IEEE Symp. on Logic in Computer Science, pages 51–62, Santa Barbara, California, June 2000.

    Google Scholar 

  5. K.J. Compton and C.W. Henson. A uniform method for proving lower bounds on the computational complexity of logical theories. Annals of Pure and Applied Logic, 48:1–79, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  6. J. Ferrante and C.W. Rackoff. The computational complexity of logical theories, volume 718 of Lecture Notes in Mathematics. Springer-Verlag, 1979.

    Google Scholar 

  7. B. Khoussainov and A. Nerode. Automatic presentations of structures. In Daniel Leivant, editor, Logic and Computational Complexity, International Workshop LCC’ 94, volume 960 of Lecture Notes in Computer Science, pages 367–392. Springer Verlag, 1995.

    Google Scholar 

  8. T. Rybina and A. Voronkov. A decision procedure for term algebras with queues. ACM Transactions on Computational Logic, 2(2):155–181, 2001.

    Article  MathSciNet  Google Scholar 

  9. W. Thomas. Infinite trees and automaton definable relations over omega-words. Theoretical Computer Science, 103(1):143–159, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  10. H. Volger. A new hierarchy of elementary recursive decision problems. Methods of Operations Research, 45:509–519, 1983.

    MATH  MathSciNet  Google Scholar 

  11. H. Volger. Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories (Note). Theoretical Computer Science, 23:333–337, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  12. S. Vorobyov and A. Voronkov. Complexity of nonrecursive logic programs with complex values. In PODS’98, pages 244–253, Seattle, Washington, 1998. ACM Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Manchester, Manchester

    Tatiana Rybina & Andrei Voronkov

Authors
  1. Tatiana Rybina
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrei Voronkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Mathematics and Computer Science, Technische Universiteit Eindhoven, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Jos C. M. Baeten

  2. School of Industrial and Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive, Atlanta, GA, 30332-0205, USA

    Jan Karel Lenstra

  3. Department of Information Technology, Uppsala University, P.O. Box 337, 75105, Uppsala, Sweden

    Joachim Parrow

  4. Faculty of Electrical Engineering, Mathematics and Computer Science, University of Twente, P.O. Box 217, 7500 AE, Enschede, The Netherlands

    Gerhard J. Woeginger

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rybina, T., Voronkov, A. (2003). Upper Bounds for a Theory of Queues. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds) Automata, Languages and Programming. ICALP 2003. Lecture Notes in Computer Science, vol 2719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45061-0_56

Download citation

  • DOI: https://doi.org/10.1007/3-540-45061-0_56

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40493-4

  • Online ISBN: 978-3-540-45061-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation