
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Alexandre Petrenko, Nina Yevtushenko, "Testing from Partial Deterministic FSM Specifications," IEEE Transactions on Computers, vol. 54, no. 9, pp. 11541165, September, 2005.  
BibTex  x  
@article{ 10.1109/TC.2005.152, author = {Alexandre Petrenko and Nina Yevtushenko}, title = {Testing from Partial Deterministic FSM Specifications}, journal ={IEEE Transactions on Computers}, volume = {54}, number = {9}, issn = {00189340}, year = {2005}, pages = {11541165}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2005.152}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Testing from Partial Deterministic FSM Specifications IS  9 SN  00189340 SP1154 EP1165 EPD  11541165 A1  Alexandre Petrenko, A1  Nina Yevtushenko, PY  2005 KW  Index Terms Finite State Machine KW  partially specified FSM KW  test generation KW  weak conformance testing KW  fault detection KW  state identification KW  checking experiment. VL  54 JA  IEEE Transactions on Computers ER   
[1] G. v. Bochmann and A. Petrenko, “Protocol Testing: Review of Methods and Relevance for Software Testing,” Proc. ACM Int'l Symp. Software Testing and Analysis (ISSTA '94) pp. 109124, 1994.
[2] T.S. Chow, “Test Software Design Modeled by Finite State Machines,” IEEE Trans. Software Eng., vol. 4, no. 3, pp. 178187, 1978.
[3] S. Fujiwara, G. v. Bochmann, F. Khendek, M. Amalou, and A. Ghedamsi, “Test Selection Based on Finite State Models,” IEEE Trans. Software Eng., vol. 17, no. 6, pp. 591603, June 1991.
[4] S. Goren and F.J. Ferguson, “CHESMIN: A Heuristic for State Reduction in Incompletely Specified Finite State Machines,” Proc. 2002 Design, Automation, and Test in Europe Conf. and Exhibition, 2002.
[5] A. Gill, Introduction to the Theory of FiniteState Machines. New York: McGrawHill, 1962.
[6] G. Gonenc, “A Method for the Design of Fault Detection Experiments,” IEEE Trans. Computers, vol. 19, no. 6, pp. 551558, June 1970.
[7] F.C. Hennie, “Fault Detecting Experiments for Sequential Circuits,” Proc. IEEE Fifth Ann. Symp. Switching Circuit Theory and Logical Design, pp. 95110, 1964.
[8] R.M. Hierons and H. Ural, “Reduced Length Checking Sequences,” IEEE Trans. Computers, vol. 51, no. 9, pp. 11111117, Sept. 2002.
[9] E.P. Hsieh, “Checking Experiments for Sequential Machines,” IEEE Trans. Computers, vol. 20, no. 10, pp. 11521166, Oct. 1971.
[10] J. Kella, “Sequential Machine Identification,” IEEE Trans. Computers, vol. 20, no. 3, pp. 332338, Mar. 1971.
[11] J. Kim and M.M. Newborn, “The Simplification of Sequential Machines with Input Restrictions,” IEEE Trans. Computers, vol. 21, no. 12, pp. 14401443, Dec. 1972.
[12] Z. Kohavi, Switching and Finite Automata Theory. New York: McGrawHill, 1970.
[13] I. Koufareva and M. Dorofeeva, “A Novel Modification of WMethod,” Joint Bull. Novosibirsk Computing Center and A.P. Ershov Inst. of Informatics Systems, Series: Computing Science, no. 18, pp. 6981, NCC Publisher, Novosibirsk, 2002.
[14] R. Lai, “A Survey of Communication Protocol Testing,” J. Systems and Software, vol. 62, pp. 2146, 2002.
[15] D. Lee and M. Yannakakis, “Testing FiniteState Machines: State Identification and Verification,” IEEE Trans. Computers, vol. 43, no. 3, pp. 306320, Mar. 1994.
[16] D. Lee and M. Yannakakis, “Principles and Methods of Testing Finite State Machines, a Survey,” Proc. IEEE, vol. 84, no. 8, pp. 10901123, 1996.
[17] E. Moore, “GedankenExperiments on Sequential Machines,” Automata Studies, Princeton, N.J.: Princeton Univ. Press, pp. 129153, 1956.
[18] A. Petrenko, “Fault ModelDriven Test Derivation from Finite State Models: Annotated Bibliography,” Proc. Modeling and Verification of Parallel Processes (MOVEP 2000), pp. 196205, 2000.
[19] A. Petrenko, N. Yevtushenko, and G. v. Bochmann, “Testing Deterministic Implementations from Their Nondeterministic Specifications,” Proc. IFIP Ninth Int'l Workshop Testing of Communicating Systems, pp. 125140, 1996.
[20] A. Petrenko, N. Yevtushenko, and R. Dssouli, “Testing Strategies for Communicating FSMs,” Proc. IFIP Seventh Int'l Workshop Protocol Test Systems, pp. 193208, 1994.
[21] A. Petrenko, N. Yevtushenko, A. Lebedev, and A. Das, “Nondeterministic State Machines in Protocol Conformance Testing,” Proc. IFIP Sixth Int'l Workshop Protocol Test Systems, pp. 363378, 1993.
[22] A. Petrenko and N. Yevtushenko, “On Test Derivation from Partial Specifications,” Proc. IFIP Joint Int'l Conf. Formal Description Techniques for Distributed Systems and Comm. Protocols and Protocol Specification, Testing, and Verification (FORTE/PSTV 2000) pp. 85102, 2000.
[23] J.F. Poage and E.J. McCluskey, “Derivation of Optimum Test Sequences for Sequential Machines,” Proc. Fifth Ann. Symp. Switching Theory and Logical Design, pp. 121132, 1964.
[24] I. Pomeranz and S.M. Reddy, “Test Generation for Multiple StateTable Faults in FiniteState Machines,” IEEE Trans. Computers, vol. 46, no. 7, pp. 783794, July 1997.
[25] A. Rezaki and H. Ural, “Construction of Checking Sequences Based on Characterization Sets,” Computer Comm., vol. 18, pp. 911920, Dec. 1995.
[26] J.K. Rho, G. Hachtel, and F. Somentzi, “Don't Care Sequences and the Optimization of Interacting Finite State Machines,” Proc. IEEE Conf. ComputerAided Design, pp. 414421, 1991.
[27] R. Shehady and D.P. Siewiorek, “A Method to Automate User Interface Testing Using Variable Finite State Machines,” Proc. 27th Int'l Symp. Fault Tolerant Computing pp. 8088, 1997.
[28] B.S.W. Schröder, Ordered Sets: An Introduction. Boston: Birkhäuser, 2003.
[29] D.P. Sidhu and T.K. Leung, “Formal Methods for Protocol Testing: A Detailed Study,” IEEE Trans. Software Eng., vol. 15, no. 4, pp. 413426, Apr. 1989.
[30] H. Ural, “Formal Methods for Test Sequence Generation,” Computer Comm., vol. 15, no. 5, pp. 311325, 1992.
[31] M.P. Vasilevskii, “Failure Diagnosis of Automata,” Cybernetics, no. 4, pp. 653665, 1973.
[32] M. Yannakakis and D. Lee, “Testing Finite State Machines: Fault Detection,” J. Computer and System Sciences, vol. 50, pp. 209227, 1995.
[33] N. Yevtushenko and A. Petrenko, “Synthesis of Test Experiments in Some Classes of Automata,” Automatic Control and Computer Sciences, no. 4, pp. 5055, 1990.
[34] N. Yevtushenko and A. Petrenko, “Test Derivation Method for an Arbitrary Deterministic Automaton,” Automatic Control and Computer Sciences, no. 5, pp. 6568, 1990.