Abstract
In this paper we improve our previous work by introducing optimized on-the-fly algorithms to test universality and inclusion problems of visibly pushdown automata. We implement the proposed algorithms in a prototype tool. We conduct experiments on randomly generated VPA. The experimental results show that the proposed method outperforms the standard one by several orders of magnitude. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Van Nguyen, T., & Ohsaki, H. (2012). On model checking for visibly pushdown automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7183 LNCS, pp. 408–419). https://doi.org/10.1007/978-3-642-28332-1_35
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
