Skip to main content
SpringerLink
Log in

Synthesis Problems for One-Counter Automata

  • Conference paper
  • First Online:
Reachability Problems (RP 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9328))

Included in the following conference series:

  • 321 Accesses

Abstract

We consider the LTL synthesis problem for one-counter automata with integer-valued parameters, where counter values range over the nonnegative integers and counter updates are encoded in binary. This problem asks whether for a given parametric one-counter automaton and LTL formula there exist values for the parameters such that all computations from the initial configuration satisfy the formula. We show that LTL synthesis is decidable by translating it to a formula of a decidable fragment of Presburger arithmetic with divisibility.

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 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 44.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.

Similar content being viewed by others

References

  1. Berman, P., Karpinski, M., Larmore, L.L., Plandowski, W., Rytter, W.: On the complexity of pattern matching for highly compressed two-dimensional texts. In: Apostolico, A., Hein, J. (eds.) CPM 1997. LNCS, vol. 1264, pp. 40–51. Springer, Heidelberg (1997)

    Google Scholar 

  2. Bouajjani, A., Bozga, M., Habermehl, P., Iosif, R., Moro, P., Vojnar, T.: Programs with lists are counter automata. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 517–531. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  3. Bozga, M., Iosif, R.: On decidability within the arithmetic of addition and divisibility. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 425–439. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. Chitic, C., Rosu, D.: On validation of XML streams using finite state machines. In: WEBDB 2004, pp. 85–90. ACM Press (2004)

    Google Scholar 

  5. Göller, S., Haase, C., Ouaknine, J., Worrell, J.: Model checking succinct and parametric one-counter automata. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 575–586. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  6. Haase, C.: Subclasses of Presburger arithmetic and the weak EXP hierarchy. In: Proceedings of CSL-LICS, pp. 47–56. ACM (2014)

    Google Scholar 

  7. Haase, C., Kreutzer, S., Ouaknine, J., Worrell, J.: Reachability in succinct and parametric one-counter automata. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 369–383. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  8. Ibarra, O.H., Dang, Z.: On two-way finite automata with monotonic counters and quadratic Diophantine equations. Theor. Comput. Sci. 312(2–3), 359–378 (2004)

    Article  MATH  Google Scholar 

  9. Ibarra, O.H., Jiang, T., Trân, N., Wang, H.: New decidability results concerning two-way counter machines and applications. In: Lingas, A., Karlsson, R., Carlsson, S. (eds) ICALP 1993. LNCS, vol. 700. Springer, Heidelberg (1993)

    Google Scholar 

  10. Ibarra, O.H., Su, J., Dang, Z., Bultan, T., Kemmerer, R.A.: Counter machines and verification problems. Theor. Comput. Sci. 289(1), 165–189 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  11. Lechner, A., Ouaknine, J., Worrell, J.: On the complexity of linear arithmetic with divisibility. In: Proceedings of LICS (2015)

    Google Scholar 

  12. Lipshitz, L.: The Diophantine problem for addition and divisibility. Transactions of the American Mathematical Society 235, 271–283 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  13. Lipshitz, L.: Some remarks on the Diophantine problem for addition and divisibility. Bull. Soc. Math. Belg. Sér. B 33(1), 41–52 (1981)

    MathSciNet  MATH  Google Scholar 

  14. Mahler, K.: On the Chinese remainder theorem. Math. Nach. 18, 120–122 (1958)

    Article  MathSciNet  MATH  Google Scholar 

  15. Minsky, M.: Recursive unsolvability of Post’s problem of “tag” and other topics in theory of Turing machines. Annals of Mathematics 74, 437–455 (1961)

    Article  MathSciNet  MATH  Google Scholar 

  16. Robinson, J.: Definability and decision problems in arithmetic. Journal of Symbolic Logic 14(2), 98–114 (1949)

    Article  MathSciNet  MATH  Google Scholar 

  17. Vardi, M.Y.: Branching vs. Linear time: final showdown. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 1–22. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  18. Wolper, P.: Constructing automata from temporal logic formulas: a tutorial. In: Brinksma, E., Hermanns, H., Katoen, J.-P. (eds.) EEF School 2000 and FMPA 2000. LNCS, vol. 2090, pp. 261–277. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Oxford, Oxford, UK

    Antonia Lechner

Authors
  1. Antonia Lechner
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Antonia Lechner .

Editor information

Editors and Affiliations

  1. The Institute of Informatics, University of Warsaw, Warsaw, Poland

    Mikolai Bojanczyk

  2. The Institute of Informatics, University of Warsaw, Warsaw, Poland

    Slawomir Lasota

  3. University of Liverpool, Liverpool, United Kingdom

    Igor Potapov

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Lechner, A. (2015). Synthesis Problems for One-Counter Automata. In: Bojanczyk, M., Lasota, S., Potapov, I. (eds) Reachability Problems. RP 2015. Lecture Notes in Computer Science(), vol 9328. Springer, Cham. https://doi.org/10.1007/978-3-319-24537-9_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-24537-9_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-24536-2

  • Online ISBN: 978-3-319-24537-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation