Yalçın, Cihan Mehmet and Yenigün, Hüsnü (2006) Using distinguishing and UIO sequences together in a checking sequence. Lecture Notes in Computer Science (Testing of Communicating Systems, Proceedings), 3964 . pp. 259-273. ISSN 0302-9743 (Print) 1611-3349 (Online)
![[thumbnail of This is a RoMEO green publisher -- author can archive pre-print (ie pre-refereeing) and post-print (ie final draft post-refereeing)]](https://research.sabanciuniv.edu/style/images/fileicons/application_pdf.png)
PDF (This is a RoMEO green publisher -- author can archive pre-print (ie pre-refereeing) and post-print (ie final draft post-refereeing))
3011800000161.pdf
Download (165kB)
Official URL: http://dx.doi.org/10.1007/11754008_17
Abstract
If a finite state machine M does not have a distinguishing sequence, but has UIO sequences for its states, there are methods to produce a checking sequence for M. However, if M has a distinguishing sequence D, then there are methods that make use of D to construct checking sequences that are much shorter than the ones that would be constructed by using only the UIO sequences for M. The methods to applied when a distinguishing sequence exists, only make use of the distinguishing sequences. In this paper we show that, even if M has a distinguishing sequence D, the UIO sequences can still be used together with D to construct shorter checking sequences.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Distinguishing sequences; UIO sequences; checking sequence |
| Subjects: | Q Science > QA Mathematics |
| Divisions: | Faculty of Engineering and Natural Sciences > Academic programs > Computer Science & Eng. Faculty of Engineering and Natural Sciences |
| Depositing User: | Hüsnü Yenigün |
| Date Deposited: | 24 Aug 2006 03:00 |
| Last Modified: | 03 Sep 2019 16:14 |
| URI: | https://research.sabanciuniv.edu/id/eprint/4 |
Actions (login required)
- View Item