Generalizing redundancy elimination in checking sequences

Authors:
K. Tuncay Tekle;Hasan Ural;M. Cihan Yalcin;Husnu Yenigun
Affiliations:
Faculty of Engineering and Natural Sciences, Sabanci University, Tuzla, Istanbul, Turkey;School of Information Technology and Engineering, University of Ottawa, Ottawa, Ontario, Canada;Faculty of Engineering and Natural Sciences, Sabanci University, Tuzla, Istanbul, Turkey;Faculty of Engineering and Natural Sciences, Sabanci University, Tuzla, Istanbul, Turkey
Venue:
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Year:
2005

Citing 14
Cited 7

A protocol test generation procedure

Computer Networks and ISDN Systems
On the generation of minimal-length conformance tests for communication protocols

IEEE/ACM Transactions on Networking (TON)
A note on approximation of the vertex cover and feedback vertex set problems—unified approach

Information Processing Letters
Computer networks (3rd ed.)

Computer networks (3rd ed.)
On Minimizing the Lengths of Checking Sequences

IEEE Transactions on Computers
Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and Bayesian inference

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Switching and Finite Automata Theory: Computer Science Series

Switching and Finite Automata Theory: Computer Science Series
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Testing Finite-State Machines: State Identification and Verification

IEEE Transactions on Computers
Reduced Length Checking Sequences

IEEE Transactions on Computers
Optimizing the Length of Checking Sequences

IEEE Transactions on Computers
A Method for the Design of Fault Detection Experiments

IEEE Transactions on Computers
Fault detecting experiments for sequential circuits

SWCT '64 Proceedings of the 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design
Eliminating redundant tests in a checking sequence

TestCom'05 Proceedings of the 17th IFIP TC6/WG 6.1 international conference on Testing of Communicating Systems

Using adaptive distinguishing sequences in checking sequence constructions

Proceedings of the 2008 ACM symposium on Applied computing
Exploring alternatives for transition verification

Journal of Systems and Software
Reducing test sequence length using invertible sequences

ICFEM'07 Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering
Using distinguishing and UIO sequences together in a checking sequence

TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
Minimizing coordination channels in distributed testing

FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
New state-recognition patterns for conformance testing of finite state machine implementations

Computer Standards & Interfaces
On "Exploring alternatives for transition verification"

Journal of Systems and Software

Quantified Score

Hi-index	0.02

Visualization

Abstract

Based on a distinguishing sequence for a Finite State Machine (FSM), an efficient checking sequence may be produced from the elements of a set $E_{\alpha^{\prime}}$ of α′–sequences and a set ET of T–sequences, that both recognize the states, and elements of EC which represents the transitions in the FSM. An optimization algorithm may then be used to produce a reduced length checking sequence by connecting the elements of $E_{\alpha^{\prime}}$, ET , and EC using transitions taken from an acyclic set E ′′. It is known that only a subset E′C of EC is sufficient to form a checking sequence. This paper improves this result by reducing the number of elements in E′C that must be included in the generated checking sequence.