Incomplete Distinguishing Sequences for Finite State Machines

Given a Finite State Machine (FSM) M , a Distinguishing Sequence (DS) is a test that identifies the state of M . While there are two types of DSs, preset DSs (PDSs) and adaptive DSs (ADSs), not all FSMs possess a DS. In this paper, we examine the problem of finding incomplete PDSs and ADSs, exploring associated optimisation problems: finding a largest set of states that has a DS and finding a smallest set of DSs that, between them, distinguish all of the states. We also propose a greedy algorithm to produce a small set of incomplete ADSs and use experiments to compare this with two previously published algorithms for generating state identifiers. We show that the optimisation problems related to incomplete ADSs and PDSs are PSPACE-complete as are corresponding approximation problems. In the experiments we found that incomplete ADSs produced by the proposed greedy algorithm led to relatively compact state identifiers.

[1]  Sying-Jyan Wang,et al.  FSM-based programmable memory BIST with macro command , 2005, 2005 IEEE International Workshop on Memory Technology, Design, and Testing (MTDT'05).

[2]  Güney Gönenç,et al.  A Method for the Design of Fault Detection Experiments , 1970 .

[3]  Gregor von Bochmann,et al.  Testing Non-Deterministic State Machines with Fault Coverage , 1991, Protocol Test Systems.

[4]  M. N. Sokolovskii.  Diagnostic experiments with automata , 1971, Cybernetics.

[5]  Robert M. Hierons,et al.  Testing from a nondeterministic finite state machine using adaptive state counting , 2004, IEEE Transactions on Computers.

[6]  Robert M. Hierons,et al.  Checking Sequence Construction Using Adaptive and Preset Distinguishing Sequences , 2009, 2009 Seventh IEEE International Conference on Software Engineering and Formal Methods.

[7]  Ana R. Cavalli,et al.  FSM-based conformance testing methods: A survey annotated with experimental evaluation , 2010, Inf. Softw. Technol..

[8]  Nina Yevtushenko,et al.  On reducing test length for FSMs with extra states , 2012, Softw. Test. Verification Reliab..

[9]  Adenilso da Silva Simão,et al.  Evaluating test suite characteristics, cost, and effectiveness of FSM-based testing methods , 2013, Inf. Softw. Technol..

[10]  Tevfik Bultan,et al.  Verifiable concurrent programming using concurrency controllers , 2004 .

[11]  Robert V. Binder,et al.  Testing Object-Oriented Systems: Models, Patterns, and Tools , 1999 .

[12]  Gerard J. Holzmann,et al.  Design and validation of computer protocols , 1991 .

[13]  Wolfgang Grieskamp,et al.  Model‐based quality assurance of protocol documentation: tools and methodology , 2011, Softw. Test. Verification Reliab..

[14]  R. T. Boute.  Distinguishing Sets for Optimal State Identification in Checking Experiments , 1974, IEEE Transactions on Computers.

[15]  Irith Pomeranz,et al.  Test Generation for Multiple State-Table Faults in Finite-State Machines , 1997, IEEE Trans. Computers.

[16]  Hasan Ural,et al.  Lower bounds on lengths of checking sequences , 2009, Formal Aspects of Computing.

[17]  Zvi Kohavi,et al.  Checking experiments for sequential machines , 1974, Inf. Sci..

[18]  Nina Yevtushenko,et al.  Adaptive Homing and Distinguishing Experiments for Nondeterministic Finite State Machines , 2013, ICTSS.

[19]  Z. Kohavi,et al.  Variable-Length Distinguishing Sequences and Their Application to the Design of Fault-Detection Experiments , 1968, IEEE Transactions on Computers.

[20]  Sergiy Boroday.  Distinguishing Tests for Nondeterministic Finite State Machines , 1998, IWTCS.

[21]  David Lee,et al.  Testing Finite-State Machines: State Identification and Verification , 1994, IEEE Trans. Computers.

[22]  Paul Teetor,et al.  R Cookbook , 2011 .

[23]  Robert M. Hierons,et al.  Minimizing the Cost of Fault Location when Testing from a Finite State Machine , 1999, Comput. Commun..

[24]  Joan Feigenbaum,et al.  Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions , 1995, Chic. J. Theor. Comput. Sci..

[25]  Arthur D. Friedman,et al.  Fault detection in digital circuits , 1971 .

[26]  Uraz Cengiz Türker,et al.  Lookahead-Based Approaches for Minimizing Adaptive Distinguishing Sequences , 2014, ICTSS.

[27]  Robert M. Hierons,et al.  Distinguishing Sequences for Partially Specified FSMs , 2014, NASA Formal Methods.

[28]  Robert M. Hierons,et al.  Generating a checking sequence with a minimum number of reset transitions , 2010, Automated Software Engineering.

[29]  Alexandre Petrenko,et al.  Generating Checking Sequences for Partial Reduced Finite State Machines , 2008, TestCom/FATES.

[30]  Nina Yevtushenko,et al.  Testing from partial deterministic FSM specifications , 2005, IEEE Transactions on Computers.

[31]  Nina Yevtushenko,et al.  An Improved Conformance Testing Method , 2005, FORTE.

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

[33]  Arthur Gill,et al.  Introduction to the theory of finite-state machines , 1962 .

[34]  Shambhu J. Upadhyaya,et al.  Programmable memory BIST and a new synthesis framework , 1999, Digest of Papers. Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing (Cat. No.99CB36352).

[35]  Alexandre Petrenko,et al.  Test Selection Based on Communicating Nondeterministic Finite-State Machines Using a Generalized WP-Method , 1994, IEEE Trans. Software Eng..

[36]  F. C. Hennine.  Fault detecting experiments for sequential circuits , 1964, SWCT 1964.

[37]  I. K. Rystsov.  Proof of an achievable bound on the length of a conditional diagnostic experiment for a finite automaton , 1976, Cybernetics.

[38]  May Haydar,et al.  Formal Verification of Web Applications Modeled by Communicating Automata , 2004, FORTE.

[39]  Canan Güniçen,et al.  Generating Preset Distinguishing Sequences Using SAT , 2011, ISCIS.

[40]  Alfred V. Aho,et al.  An optimization technique for protocol conformance test generation based on UIO sequences and rural Chinese postman tours , 1991, IEEE Trans. Commun..

[41]  M. G. Bulmer,et al.  Principles of Statistics. , 1969 .

[42]  Lei Xie,et al.  An improved FSM-based method for BGP protocol conformance testing , 2008, 2008 International Conference on Communications, Circuits and Systems.

[43]  Paul D. Amer,et al.  Improvements on UIO Sequence Generation and Partial UIO Sequences , 1992, PSTV.

[44]  Krishan K. Sabnani,et al.  A Protocol Test Generation Procedure , 1988, Comput. Networks.

[45]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[46]  Robert M. Hierons,et al.  Optimizing the length of checking sequences , 2006, IEEE Transactions on Computers.

[47]  W. Kruskal,et al.  Use of Ranks in One-Criterion Variance Analysis , 1952 .

[48]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[49]  John E. Hopcroft,et al.  An n log n algorithm for minimizing states in a finite automaton , 1971 .

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

[51]  Bruno Legeard,et al.  A taxonomy of model‐based testing approaches , 2012, Softw. Test. Verification Reliab..

[52]  Nina Yevtushenko,et al.  Nondeterministic State Machines in Protocol Conformance Testing , 1993, Protocol Test Systems.

[53]  A. Drumea,et al.  Finite state machines and their applications in software for industrial control , 2004, 27th International Spring Seminar on Electronics Technology: Meeting the Challenges of Electronics Technology Progress, 2004..

[54]  Alexandre Petrenko,et al.  Selecting test sequences for partially-specified nondeterministic finite state machines , 1995 .

[55]  Alexandre Petrenko,et al.  Fault Coverage-Driven Incremental Test Generation , 2010, Comput. J..

[56]  Dexter Kozen,et al.  Lower bounds for natural proof systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[57]  Alexandre Petrenko,et al.  Conformance Testing of Protocol Machines without Reset , 1993, PSTV.

[58]  Hasan Ural,et al.  Formal methods for test sequence generation , 1992, Comput. Commun..

[59]  Krishan K. Sabnani,et al.  A new technique for generating protocol test , 1985, SIGCOMM 1985.

[60]  W. Cleveland.  Robust Locally Weighted Regression and Smoothing Scatterplots , 1979 .

[61]  Robert M. Hierons.  Using a minimal number of resets when testing from a finite state machine , 2004, Inf. Process. Lett..