Tekle, Tuncay K. and Ural, Hasan and Yalçın, Cihan Mehmet and Yenigün, Hüsnü (2005) Generalizing redundancy elimination in checking sequences. Lecture notes in computer science, 3733 . 915 - 926. ISSN 0302-9743 (Print) 1611-3349 (Online)
Full text not available from this repository. (Request a copy)
Official URL: http://dx.doi.org/10.1007/11569596_93
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 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 , 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.
| Item Type: | Article |
|---|---|
| Subjects: | Q Science > QA Mathematics > QA075 Electronic computers. Computer science |
| Divisions: | Faculty of Engineering and Natural Sciences |
| Depositing User: | Hüsnü Yenigün |
| Date Deposited: | 25 Nov 2005 02:00 |
| Last Modified: | 15 May 2009 09:32 |
| URI: | https://research.sabanciuniv.edu/id/eprint/630 |
Actions (login required)
- View Item