Homing Sequence Derivation with Quantified Boolean Satisfiability

Hung-En Wang (1) , Kuan-Hua Tu (1) , Jie-Hong R. Jiang (1) , Natalia Kushik (2, 3, 4, 5)

1 NTU - National Taiwan University [Taiwan]
2 Tomsk State University [Tomsk]
3 METHODES-SAMOVAR - Méthodes et modèles pour les réseaux
4 TSP - RS2M - Département Réseaux et Services Multimédia Mobiles
5 CNRS - Centre National de la Recherche Scientifique

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.

Mots clés: Nondeterministic finite state machine; Homing sequence; Quantified Boolean formula

Domaines: Informatique [cs]; Réseaux et télécommunications [cs.NI]

Hung-En Wang, Kuan-Hua Tu, Jie-Hong R. Jiang, Natalia Kushik. Homing Sequence Derivation with Quantified Boolean Satisfiability. 29th IFIP International Conference on Testing Software and Systems (ICTSS), Oct 2017, St. Petersburg, Russia. pp.230-242, ⟨10.1007/978-3-319-67549-7_14⟩. ⟨hal-01678974⟩