Conter Machines: Decidable Properties and Applications to Verification Problems
暂无分享,去创建一个
[1] Tao Jiang,et al. New Decidability Results Concerning Two-Way Counter Machines , 1995, SIAM J. Comput..
[2] Rohit Parikh,et al. On Context-Free Languages , 1966, JACM.
[3] Javier Esparza,et al. Decidability of model checking for infinite-state concurrent systems , 1997, Acta Informatica.
[4] Brenda S. Baker,et al. Reversal-Bounded Multipushdown Machines , 1974, J. Comput. Syst. Sci..
[5] Leslie G. Valiant,et al. Deterministic One-Counter Automata , 1975, J. Comput. Syst. Sci..
[6] M. Minsky. Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .
[7] Oscar H. Ibarra,et al. Reversal-Bounded Multicounter Machines and Their Decision Problems , 1978, JACM.
[8] Brenda S. Baker,et al. Reversal-Bounded Multi-Pushdown Machines: Extended Abstract , 1972, SWAT.
[9] Rajeev Alur,et al. A Theory of Timed Automata , 1994, Theor. Comput. Sci..
[10] Pierre Wolper,et al. Verifying Systems with Infinite but Regular State Spaces , 1998, CAV.
[11] Eitan M. Gurari,et al. Simple Counter Machines and Number-Theoretic Problems , 1979, J. Comput. Syst. Sci..
[12] Hubert Comon-Lundh,et al. Multiple Counters Automata, Safety Analysis and Presburger Arithmetic , 1998, CAV.
[13] Oscar H. Ibarra,et al. Binary Reachability Analysis of Discrete Pushdown Timed Automata , 2000, CAV.
[14] H IbarraOscar. Reversal-Bounded Multicounter Machines and Their Decision Problems , 1978 .