Counter machines: Decidable properties and applications to verification problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1893, Issue , 2000, Pages 426-435

  Ibarra, Oscar H ^a   Su, Jianwen ^a   Dang, Zhe ^a   Bultan, Tevfik ^a   Kemmerer, Richard ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EQUIVALENCE CLASSES;

COUNTER MACHINES; DECISION PROBLEMS; EQUIVALENCE PROBLEM; LINEAR RELATION; REACHABILITY PROBLEM; REVERSAL-BOUNDED; SAFETY PROPERTY; VERIFICATION PROBLEMS;

COMPUTABILITY AND DECIDABILITY;

EID: 84959242935     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44612-5_38     Document Type: Conference Paper

References (15)

1. R. Alur and D. Dill. “A theory of timed automata,” Theo. Comp. Sci, 126(2):183-235, 1994.
2. B. Baker and R. Book. “Reversal-bounded multipushdown machines,” J.C.S.S., 8:315-332, 1974.
3. H. Comon and Y. Jurski. “Multiple counters automata, safety analysis and Presburger arithmetic,” Proc. Int. Conf. on Computer Aided Verification, pp. 268-279, 1998.
4. Z. Dang, O. H. Ibarra, T. Bultan, R. A. Kemmerer, and J. Su. “Decidable approximations on discrete clock machines with parameterized durations,” in preparation.
5. Z. Dang, O. H. Ibarra, T. Bultan, R. A. Kemmerer, and J. Su. “Binary reachability analysis of discrete pushdown timed automata,” to appear in CAV 2000.
6. Z. Dang, O. H. Ibarra, T. Bultan, R. A. Kemmerer, and J. Su. “Past machines,” in preparation.
7. J. Esparza. “Decidability of model checking for infinite-state concurrent systems,” Acta Informatica, 34(2):85-107, 1997.
8. E. M. Gurari and O. H. Ibarra. “Simple counter machines and number-theoretic problems,” J.C.S.S., 19:145-162, 1979.
9. O. H. Ibarra. “Reversal-bounded multicounter machines and their decision problems,” J. ACM, 25:116-133, 1978.
10. O. H. Ibarra, T. Jiang, N. Tran, and H. Wang. “New decidability results concerning two-way counter machines,” SIAM J. Comput., 24(1):123-137, 1995.
11. Y. Matijasevic. “Enumerable sets are Diophantine,” Soviet Math. Dokl, 11:354-357, 1970.
12. M. Minsky. “Recursive unsolvability of Post's problem of Tag and other topics in the theory of Turing machines.” Ann. of Math., 74:437-455, 1961.
13. R. Parikh. “On context-free languages,” J. ACM, 13:570-581, 1966.
14. L. G. Valiant and M. S. Paterson. “Deterministic one-counter automata,” J.C.S.S., 10:340-350, 1975.
15. P. Wolper and B. Boigelot. “Verifying systems with infinite but regular state spaces,” Proc. 10th Int. Conf. on Computer Aided Verification, pp. 88-97, 1998.