Heuristics for unique input output sequence computation

Warning The system is temporarily closed to updates for reporting purpose.

Kaynar, Hakan (2008) Heuristics for unique input output sequence computation. [Thesis]

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: (Table of Contents)


In this thesis, several heuristic methods are proposed for the computation of Unique Input Output (UIO) Sequences for the states of a given finite state machine. UIO computation problem is known to be a hard problem. The methods suggested in this work are based on unfolding an exponential tree as the other methods existing in the literature. However, our methods perform a search guided by some heuristic information. We also introduce a parameter for inference based UIO sequence computation for a trade off between the memory used for the computation and the UIO sequence length. Based on a randomly generated set of finite state machines, an extensive experimental study is also provided to compare the performance of our methods between each other and to those already exist in the literature.

Item Type:Thesis
Uncontrolled Keywords:Formal testing methods. -- Checking sequences. -- UIO sequences. -- Unique input output sequences. -- Biçimsel sınama yöntemleri. -- Kontrol dizisi. -- Benzersiz girdi çıktı dizileri.
Subjects:T Technology > TK Electrical engineering. Electronics Nuclear engineering > TK7800-8360 Electronics > TK7885-7895 Computer engineering. Computer hardware
ID Code:14120
Deposited By:IC-Cataloging
Deposited On:12 Jul 2010 12:16
Last Modified:25 Mar 2019 16:59

Repository Staff Only: item control page