Geodesic
Algorithms for the boundedness problem for Minsky counter machines
Modelirovanie i analiz informacionnyh sistem, Tome 15 (2008) no. 4, pp. 42-55.

Voir la notice de l'article provenant de la source Math-Net.Ru

In the paper, the algorithms that can be applied to solving the boundedness problem for Minsky counter machines are discussed. We introduce a polinomial-time algorithm that solves the boundedness problem for one-counter machines using the memory commensurate with the memory required for a machine representation.
Keywords: Minsky counter machines, boundedness problem, algorithm of the search of a cycle in a periodic sequence, model verification. 
@article{MAIS_2008_15_4_a4,
     author = {E. V. Kuzmin and D. Ju. Chalyy},
     title = {Algorithms for the boundedness problem for {Minsky} counter machines},
     journal = {Modelirovanie i analiz informacionnyh sistem},
     pages = {42--55},
     publisher = {mathdoc},
     volume = {15},
     number = {4},
     year = {2008},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MAIS_2008_15_4_a4/}
}
TY  - JOUR
AU  - E. V. Kuzmin
AU  - D. Ju. Chalyy
TI  - Algorithms for the boundedness problem for Minsky counter machines
JO  - Modelirovanie i analiz informacionnyh sistem
PY  - 2008
SP  - 42
EP  - 55
VL  - 15
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MAIS_2008_15_4_a4/
LA  - ru
ID  - MAIS_2008_15_4_a4
ER  - 
%0 Journal Article
%A E. V. Kuzmin
%A D. Ju. Chalyy
%T Algorithms for the boundedness problem for Minsky counter machines
%J Modelirovanie i analiz informacionnyh sistem
%D 2008
%P 42-55
%V 15
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MAIS_2008_15_4_a4/
%G ru
%F MAIS_2008_15_4_a4
E. V. Kuzmin; D. Ju. Chalyy. Algorithms for the boundedness problem for Minsky counter machines. Modelirovanie i analiz informacionnyh sistem, Tome 15 (2008) no. 4, pp. 42-55. http://geodesic.mathdoc.fr/item/MAIS_2008_15_4_a4/

[1] E. M. Klark, O. Gramberg, D. Peled, Verifikatsiya modelei programm: Model Checking, MTsNMO, 2002, 416 pp.

[2] E. V. Kuzmin, D. Yu. Chalyi, “O razreshimosti problem ogranichennosti dlya schetchikovykh mashin Minskogo”, Modelirovanie i analiz informatsionnykh sistem, 15:1 (2008), 16–26

[3] E. V. Kuzmin, V. A. Sokolov, D. Yu. Chalyi, “Problemy ogranichennosti schetchikovykh mashin Minskogo”, Doklady Akademii nauk, 421:6 (2008), 741–743 | MR

[4] M. Minskii, Vychisleniya i avtomaty, Mir, M., 1971, 268 pp. | MR

[5] S. Demri, R. Lazic, A. Sangnier, “Model checking freeze LTL over one-counter automata”, Proceedings of the 11th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'08), LNCS, 2008 http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DLS-fossacs08.pdf | MR

[6] R. Sedgewick, T. G. Szymanski, A. C.-C. Yao, “The Complexity of Finding Cycles in Periodic Functions”, SIAM (Society for Industrial and Applied Mathematics) Journal on Computing, 11:2 (1982), 376–390 | MR | Zbl