On one class of counter machines

1. Abdulla, P.A., Čerāns, K., Jonsson, B. and Yih-Kuen, T., General Decidability Theorems for Infinite-State Systems, Proc. 11th IEEE Symp. Logic in Computer Science (LICS’96), 1996, pp. 313–321.

2. Araki, T. and Kasami, T., Some Decision Problems Related to the Reachability Problem for Petri Nets, Theor. Comp. Sci., 1977, no. 3, pp. 85–104.

3. Dickson, L.E., Finiteness of the Odd Perfect and Primitive Abundant Numbers with r Distinct Prime Factors, Amer. J. Math., 1913, vol. 35, pp. 413–422.

   Article  MATH  MathSciNet  Google Scholar 

4. Dufourd, C., Jancar, P. and Schnoebelen, Ph., Boundedness of Reset P/T nets, Proc. ICALP 1999, LNCS 1644, 1999, pp. 301–310.

5. Finkel, A. and Schnoebelen, Ph., Well-Structured Transition Systems Everywhere! Theor. Comp. Sci., 2001, vol. 256, nos. 1–2, pp. 63–92.

   Article  MATH  MathSciNet  Google Scholar 

6. Finkel, A. and Sutre, G., An Algorithm Constructing the Semilinear Post* for 2-Dim Reset/Transfer VASS, MFCS 2000, LNCS 1893, Springer, 2000, pp. 353–362.

7. Finkel, A. and Sutre, G., Decidability of Reachability Problems for Classes of Two-Counter Automata, Proceeding of STACS 2000, LNCS 1770, Springer, 2000, pp. 346–357.

8. Hack, M., Decision Problems for Petri Nets and Vector Addition Systems, Project MAC Memo 59, Cambridge, 1975.

9. Hack, M., The Equality Problem for Vector Addition Systems is Undecidable, Theor. Comp. Sci., 1976, vol. 2, no. 1, pp. 77–96.

   Article  MATH  MathSciNet  Google Scholar 

10. Hopcroft, J.E. and Pansiot, J., On the Reachability Problem for 5-Dimensional Vector Addition Systems, Computer science technical report, Cornell University, 1976; http://hdl.handle.net/1813/6102.

11. Kouzmin, E.V. and Sokolov V. A., Communicating Colouring Automata, Proc. Int. Workshop on Program Understanding, Novosibirsk, 2003, pp. 40–46.

12. Kouzmin, E.V., Shilov N.V., and Sokolov V.A., Model Checking μ-Calculus in Well-Structured Transition Systems, Proc. 11th Int. Symposium on Temporal Representation and Reasoning, Tatihou, France: IEEE Press, 2004, pp. 152–155.

    Chapter  Google Scholar 

13. Kouzmin, E.V., Shilov N.V., and Sokolov V.A., Model Checking μ-Calculus in Well-Structured Transition Systems, Joint Bulletin of NCC & IIS, Comp. Science, Novosibirsk, 2004, no. 20, pp. 49–59.

14. Mayr, R., Lossy Counter Machines, Tech. Report TUM-I9827, Institut für Informatik, TUM, München, Germany, 1998.

    Google Scholar 

15. Kuzmin, E.V., Nondeterministic Counter Machines, Model. Analiz Inform. Sistem, 2003, vol. 10, no. 2, pp. 41–49.

    Google Scholar 

16. Kuzmin, E.V. and Sokolov, V. A., Interacting Coloring Processes, Model. Analiz Inform. Sistem, 2004, vol. 11, no. 2, pp. 8–17.

    Google Scholar 

17. Kuzmin, E.V. and Sokolov, V. A. Strukturirovannye sistemy perekhodov (Structured Transition Systems), Moscow, Fizmatlit, 2006.

    Google Scholar 

18. Minsky M.L., Computation: Finite and Infinite Machines, Englewood Cliffs: Prentice-Hall, 1967; Moscow, Mir, 1971.

    MATH  Google Scholar 

19. Hopcroft, J.E., Motwani, R. and Ullman, J.D. Introduction to Automata Theory, Languages, and Computation, Boston, Addison-Wesley, 2001; Moscow, Williams, 2002.

    MATH  Google Scholar 

Download references