Abstract
Homing sequence derivation for nondeterministic finite state machines (NFSMs) has important applications in system testing and verification. Unlike prior methods based on explicit tree based search, in this work we formulate the derivation of a preset homing sequence in terms of a quantified Boolean formula (QBF). The formulation allows implicit NFSM representation and compact QBF encoding for effective computation. Different encoding schemes and QBF solvers are evaluated for their suitability to homing sequence derivation. Experimental results show the generality and feasibility of the proposed method.
Cite
CITATION STYLE
Wang, H. E., Tu, K. H., Jiang, J. H. R., & Kushik, N. (2017). Homing sequence derivation with quantified boolean satisfiability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10533 LNCS, pp. 230–242). Springer Verlag. https://doi.org/10.1007/978-3-319-67549-7_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
