Homing Sequence Derivation With Quantified Boolean Satisfiability

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.

[1]  Armin Biere,et al.  DepQBF: A Dependency-Aware QBF Solver , 2010, J. Satisf. Boolean Model. Comput..

[2]  G. S. Tseitin.  On the Complexity of Derivation in Propositional Calculus , 1983 .

[3]  Jie-Hong Roland Jiang,et al.  QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving , 2015, SAT.

[4]  Mikolás Janota,et al.  Solving QBF with Counterexample Guided Refinement , 2012, SAT.

[5]  Maxim Gromov,et al.  FSMTest-1.0: A manual for researches , 2015, 2015 IEEE East-West Design & Test Symposium (EWDTS).

[6]  Victor V. Kulyamin,et al.  On the complexity of existence of homing sequences for nondeterministic finite state machines , 2014, Programming and Computer Software.

[7]  Gerassimos Barlas,et al.  Parallel implementation for deriving preset distinguishing experiments of nondeterministic finite state machines , 2017, 2017 7th International Conference on Modeling, Simulation, and Applied Optimization (ICMSAO).

[8]  Jie-Hong Roland Jiang,et al.  Unified QBF certification and its applications , 2012, Formal Methods Syst. Des..

[9]  T. Kanade.  Model-Based Testing of Reactive Systems , 2005 .

[10]  Nina Yevtushenko,et al.  Some classes of finite state machines with polynomial length of distinguishing test cases , 2016, SAC.

[11]  R. Brayton,et al.  FRAIGs: A Unifying Representation for Logic Synthesis and Verification , 2005 .

[12]  Srinivas Devadas,et al.  Logic Synthesis in a Nutshell , 2009 .

[13]  Tsun S. Chow,et al.  Testing Software Design Modeled by Finite-State Machines , 1978, IEEE Transactions on Software Engineering.

[14]  M. P. Vasilevskii.  Failure diagnosis of automata , 1973 .

[15]  Nina Yevtushenko,et al.  On the Length of Homing Sequences for Nondeterministic Finite State Machines , 2013, CIAA.

[16]  Robert K. Brayton,et al.  2QBF: Challenges and Solutions , 2016, SAT.

[17]  Abdul Rahim Haddad.  Efficient Algorithms for Constructing Preset Distinguishing Sequences for Nondeterministic Finite State Machines , 2016 .

[18]  J. Taylor,et al.  Switching and finite automata theory, 2nd ed. , 1980, Proceedings of the IEEE.

[19]  David Lee,et al.  Principles and methods of testing finite state machines-a survey , 1996, Proc. IEEE.

[20]  Robert K. Brayton,et al.  ABC: An Academic Industrial-Strength Verification Tool , 2010, CAV.

[21]  Sven Sandberg,et al.  Homing and Synchronizing Sequences , 2004, Model-Based Testing of Reactive Systems.