Safety verification for two-way finite automata with monotonic counters

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

Volumn 2450, Issue , 2003, Pages 326-338

  Ibarra, Oscar H ^a   Dang, Zhe ^b   Sun, Zhi Wei ^c  

^a University of California   (United States)

^b Washington State University   (United States)

^c NANJING UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

INITIAL STATE; MONOTONIC COUNTERS; NONNEGATIVE INTEGERS; REVERSAL-BOUNDED COUNTERS; SAFETY VERIFICATION; TWO WAYS; TWO-WAY FINITE AUTOMATA; VERIFICATION PROBLEMS;

ARTIFICIAL INTELLIGENCE;

EID: 32644436036     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45005-x_29     Document Type: Conference Paper

References (23)

1. R. Alur and D. L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183–235, April 1994.
2. R. Alur, T. A. Henzinger, and M. Y. Vardi. Parametric real-time reasoning. In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, pages 592–601, San Diego, California, 16–18 May 1993.
3. A. Bouajjani, R. Echahed, and R. Robbana. On the automatic verification of systems with continuous variables and unbounded discrete data structures. In Hybrid Systems II, volume 999 of Lecture Notes in Computer Science. Springer- Verlag, 1995.
4. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: application to model-checking. In Concurrency (CONCUR 1997), volume 1243 of Lecture Notes in Computer Science, pages 135–150. Springer-Verlag, 1997.
5. E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Workshop of Logic of Programs, volume 131 of Lecture Notes in Computer Science. Springer, 1981.
6. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finitestate concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244–263, April 1986.
7. Z. Dang. Phd. dissertation. Department of Computer Science, University of California at Santa Barbara, 2000.
8. Z. Dang, O. Ibarra, and Z. Sun. On the emptiness problems for two-way nondeterministic finite automata with one reversal-bounded counter. Submitted, 2002.
9. Zhe Dang, O. H. Ibarra, T. Bultan, R. A. Kemmerer, and J. Su. Binary reachability analysis of discrete pushdown timed automata. In Proceedings of the International Conference on Computer Aided Verification (CAV’00), volume 1855 of Lecture Notes in Computer Science, pages 69–84. Springer, 2000.
10. Zhe Dang, O. H. Ibarra, and R. A. Kemmerer. Decidable Approximations on Generalized and Parameterized Discrete Timed Automata. In Proceedings of the 7th Annual International Computing and Combinatorics Conference (COCOON’01), volume 2108 of Lecture Notes in Computer Science, pages 529–539. Springer, 2001.
11. Zhe Dang and R. A. Kemmerer. A symbolic model-checker for testing ASTRAL real-time specifications. In Proceedings of the Sixth International Conference on Real-time Computing Systems and Applications, pages 131–142. IEEE Computer Society Press, 1999.
12. Zhe Dang and R. A. Kemmerer. Using the ASTRAL Model Checker to Analyze Mobile IP. In Proceedings of the 1999 International Conference on Software Engineering (ICSE’99), pages 132–141. IEEE Computer Society Press/ACM Press, 1999.
13. Zhe Dang and R. A. Kemmerer. Three approximation techniques for ASTRAL symbolic model checking of infinite state real-time systems. In Proceedings of the 2000 International Conference on Software Engineering (ICSE’00), pages 345–354. IEEE Computer Society Press, 2000.
14. S. Ginsburg and E. Spanier. Semigroups, presburger formulas, and languages. Pacific J. of Mathematics, 16:285–296, 1966.
15. E. M. Gurari and O. H. Ibarra. The complexity of decision problems for finite-turn multicounter machines. Journal of Computer and System Sciences, 22:220–229, 1981.
16. G. J. Holzmann. The model checker SPIN. IEEE Transactions on Software Engineering, 23(5):279–295, May 1997. Special Issue: Formal Methods in Software Practice.
17. O. H. Ibarra. Reversal-bounded multicounter machines and their decision problems. Journal of the ACM, 25(1):116–133, January 1978.
18. O. H. Ibarra, T. Jiang, N. Tran, and H. Wang. New decidability results concerning two-way counter machines. SIAM J. Comput., 24:123–137, 1995.
19. O. H. Ibarra, J. Su, Zhe Dang, T. Bultan, and R. A. Kemmerer. Counter machines: decidable properties and applications to verification problems. In Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science (MFCS 2000), volume 1893 of Lecture Notes in Computer Science, pages 426–435. Springer-Verlag, 2000.
20. K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, Norwell Massachusetts, 1993.
21. 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.
22. A. P. Sistla and E. M. Clarke. Complexity of propositional temporal logics. Journal of ACM, 32(3):733–749, 1983.
23. M. Y. Vardi and P.Wolper. An automata-theoretic approach to automatic program verification (preliminary report). In Proceedings 1st Annual IEEE Symp. on Logic in Computer Science, LICS’86, Cambridge, MA, USA, 16–18 June 1986, pages 332–344, Washington, DC, 1986. IEEE Computer Society Press.