Skip to main content
SpringerLink
Log in

Algorithms for the boundedness problem for Minsky counter machines

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract

In this paper, algorithms that can be applied for solving the boundedness problem for Minsky counter machines are discussed. We introduce a polynomial-time algorithm that solves the boundedness problem for one-counter machines using memory commensurate with the memory required for the machine representation.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Clarke, E.M., Gramberg, O., and Peled, D., Verifikatsiya modelei programm, (Model Checking), Moscow: MCCME, 2002.

    Google Scholar 

  2. Kuzmin, E.V., and Chalyy, D.Yu., On the Solvability of the Boundedness Problems for Counter Minsky Machines, Modeling and analysis of information systems, 2008, vol. 15, no. 1, pp.16–26.

    Google Scholar 

  3. Kuzmin, E.V., Sokolov, V.A., and Chalyy, D. Yu., The Boundedness Problems of Counter Minsky Machines, Doklady Academii Nauk, 2008, vol. 421, no. 6, pp. 741–743.

    Google Scholar 

  4. Minsky, M. Vichisleniya i avtomaty (Calculations and Automatic), Moscow: Mir, 1971.

    Google Scholar 

  5. Demri, S., Lazic, R., and Sangnier, A., Model Checking Freeze LTL Over One-Couter Automata, Proceedings of the 11-th International Conference on Foundations of Sofware Science and Computation Structures (FoS-SaCS’08), LNCS, 2008, to appear. (http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DLS-fossacs08.pdf).

  6. Sedgewick, R., Szymanski, T.G., and Yao, A.-C.C., The Complexity of Finding Cycles in Periodic Functions, SIAM (Society for Industrial and Applied Mathematics) Journal on Computing, 1982, vol. 11, no. 2, pp. 376–390.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Yaroslavl State University, ul. Sovetskaya 14, Yaroslavl, Russia

    E. V. Kuzmin & D. J. Chalyy

Authors
  1. E. V. Kuzmin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. J. Chalyy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to E. V. Kuzmin.

Additional information

Original Russian Text © E.V. Kuzmin, D.J. Chalyy, 2008, published in Modelirovanie i Analiz Informatsionnykh Sistem, 2008, No. 4, pp. 42–55.

About this article

Cite this article

Kuzmin, E.V., Chalyy, D.J. Algorithms for the boundedness problem for Minsky counter machines. Aut. Conrol Comp. Sci. 44, 365–373 (2010). https://doi.org/10.3103/S0146411610070011

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411610070011

Keywords

Search

Navigation