Deriving adaptive distinguishing sequences for Finite State Machines
FSM (Finite State Machines) are widely used for deriving tests with guaranteed fault coverage for control systems. Distinguishing sequences (DS) are used in FSM based testing for state identification and can significantly reduce the size of a returned complete test suite. In some cases, length of di...
Uloženo v:
| Vydáno v: | Trudy Instituta sistemnogo programmirovaniâ Ročník 30; číslo 4; s. 139 - 154 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Russian Academy of Sciences, Ivannikov Institute for System Programming
01.10.2018
|
| Témata: | |
| ISSN: | 2079-8156, 2220-6426 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | FSM (Finite State Machines) are widely used for deriving tests with guaranteed fault coverage for control systems. Distinguishing sequences (DS) are used in FSM based testing for state identification and can significantly reduce the size of a returned complete test suite. In some cases, length of distinguishing sequence can be exponential with respect to the size of the FSM specification. Moreover, DS can be even longer for non-deterministic FSMs, which are used for the specification optionality description when deriving tests for real systems. Unfortunately, DS not always exist for deterministic and non-deterministic FSMs. Adaptive DS (or corresponding distinguishing test cases (DTC)) are known to exist more often and be much shorter than the preset ones that makes adaptive DS attractive for test derivation. In this paper, we investigate the properties of adaptive DS and propose an approach for optimizing the procedure for the adaptive DS derivation. For this purpose, we propose to limit the height of a DTC and correspondingly to reduce the size of a distinguishing FSM that is used for the DTC derivation in the original procedure. The efficiency of a proposed optimized procedure is evaluated by computer experiments for randomly generated FSMs up to 100 states. We also present the experimental results on checking the percentage of randomly generated FSMs when a DTC exists. |
|---|---|
| AbstractList | FSM (Finite State Machines) are widely used for deriving tests with guaranteed fault coverage for control systems. Distinguishing sequences (DS) are used in FSM based testing for state identification and can significantly reduce the size of a returned complete test suite. In some cases, length of distinguishing sequence can be exponential with respect to the size of the FSM specification. Moreover, DS can be even longer for non-deterministic FSMs, which are used for the specification optionality description when deriving tests for real systems. Unfortunately, DS not always exist for deterministic and non-deterministic FSMs. Adaptive DS (or corresponding distinguishing test cases (DTC)) are known to exist more often and be much shorter than the preset ones that makes adaptive DS attractive for test derivation. In this paper, we investigate the properties of adaptive DS and propose an approach for optimizing the procedure for the adaptive DS derivation. For this purpose, we propose to limit the height of a DTC and correspondingly to reduce the size of a distinguishing FSM that is used for the DTC derivation in the original procedure. The efficiency of a proposed optimized procedure is evaluated by computer experiments for randomly generated FSMs up to 100 states. We also present the experimental results on checking the percentage of randomly generated FSMs when a DTC exists. |
| Author | Tvardovskii, A.S. Yevtushenko, N.V. |
| Author_xml | – sequence: 1 givenname: A.S. surname: Tvardovskii fullname: Tvardovskii, A.S. – sequence: 2 givenname: N.V. surname: Yevtushenko fullname: Yevtushenko, N.V. |
| BookMark | eNo9kE1LAzEQhoNUsNb-Aw971EM037s5Fmu1UFGsnkM2mdSUuqvJtuC_d9uKl5nhmeEZeM_RoGkbQOiSkhsqJRW38-XL62SJGaEV5uRKXGN9goaMMYKVYGrQz6TUuKJSnaFxzmtCCJOk5IQO0XQKKe5isyqst19d3EHhY-56sI35Y88zfG-hcZCL0KZiFpvYQbHsbF-frOtPIF-g02A3GcZ_fYTeZ_dvd4948fwwv5sssOt_a-wqqQKVzJGqrJn3QXItreDaBRLUfiVUEMzXUnJZSgi187VWla8qD1qUfITmR69v7dp8pfhp049pbTQH0KaVsamLbgPGMilA6RA4lyKAr2tbaak8U-BJqGnvEkeXS23OCcK_jxJzCNYcgzX7YA0nRhij-S-oaW6p |
| ContentType | Journal Article |
| CorporateAuthor | TSU, Tomsk, Russia TSU, Tomsk, Russia; ISP RAS, Moscow, Russia; HSE, Moscow, Russia |
| CorporateAuthor_xml | – name: TSU, Tomsk, Russia; ISP RAS, Moscow, Russia; HSE, Moscow, Russia – name: TSU, Tomsk, Russia |
| DBID | AAYXX CITATION DOA |
| DOI | 10.15514/ISPRAS-2018-30(4)-9 |
| DatabaseName | CrossRef Directory of Open Access Journals |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ (Directory of Open Access Journals) eJournal Collection url: https://www.doaj.org/ sourceTypes: Open Website |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 2220-6426 |
| EndPage | 154 |
| ExternalDocumentID | oai_doaj_org_article_a254e69ff3354fedbba8956d26ed0fb1 10_15514_ISPRAS_2018_30_4__9 |
| GroupedDBID | 642 AAYXX ALMA_UNASSIGNED_HOLDINGS CITATION GROUPED_DOAJ OK1 |
| ID | FETCH-LOGICAL-c1569-c856f152c087b2ddf5395a439cf0f66f1546f42db553575efbcdb968d88de9473 |
| IEDL.DBID | DOA |
| ISSN | 2079-8156 |
| IngestDate | Mon Nov 03 22:03:39 EST 2025 Sat Nov 29 05:34:01 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c1569-c856f152c087b2ddf5395a439cf0f66f1546f42db553575efbcdb968d88de9473 |
| OpenAccessLink | https://doaj.org/article/a254e69ff3354fedbba8956d26ed0fb1 |
| PageCount | 16 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_a254e69ff3354fedbba8956d26ed0fb1 crossref_primary_10_15514_ISPRAS_2018_30_4__9 |
| PublicationCentury | 2000 |
| PublicationDate | 2018-10-01 |
| PublicationDateYYYYMMDD | 2018-10-01 |
| PublicationDate_xml | – month: 10 year: 2018 text: 2018-10-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | Trudy Instituta sistemnogo programmirovaniâ |
| PublicationYear | 2018 |
| Publisher | Russian Academy of Sciences, Ivannikov Institute for System Programming |
| Publisher_xml | – name: Russian Academy of Sciences, Ivannikov Institute for System Programming |
| SSID | ssj0002507301 |
| Score | 2.0415826 |
| Snippet | FSM (Finite State Machines) are widely used for deriving tests with guaranteed fault coverage for control systems. Distinguishing sequences (DS) are used in... |
| SourceID | doaj crossref |
| SourceType | Open Website Index Database |
| StartPage | 139 |
| SubjectTerms | адаптивная различающая последовательность конечный автомат тестовый пример |
| Title | Deriving adaptive distinguishing sequences for Finite State Machines |
| URI | https://doaj.org/article/a254e69ff3354fedbba8956d26ed0fb1 |
| Volume | 30 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ (Directory of Open Access Journals) eJournal Collection customDbUrl: eissn: 2220-6426 dateEnd: 20201231 omitProxy: false ssIdentifier: ssj0002507301 issn: 2079-8156 databaseCode: DOA dateStart: 20100101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELYQYmDhjSgveWCAwWqI7TgeC6UCCaqKAupm-Ym6hKoPfj9nJ63KxMIaR5H93dnfd9blDqErzmjBA9XEaykIy3NBDNAm0UD3lNnc09Tr8ONZ9PvlaCQHa62-Yk5YXR64Bq6tIYLxhQyBUs6Cd8boEjS9ywvvsmBS4JMJuRZMxTMYiD26buwsB4MklkRp_puLCqH9NBy8dobgIbclodk1uyHyFy-tle9PPNPbQzuNQMSdemL7aMNXB2h32XwBN3vxEHW74DvxNgBrpyfx0MIu7tfqc1FfK-FVljQGYYp746gucRKX-CWlUPrZEXrvPbzdP5KmJQKxsARJbMmLAJRrs1KY3LnAqeQaRIUNWSjiECsCy53hnIIQ88FYZ2RRurJ0XjJBj9Fm9VX5E4S5FaDONNXUSGAyqakQ3OWmCBpkg9ctRJaAqEld-ULFiCECqGoAVQRQ0UwxpWQL3UXUVu_GutXpAVhTNdZUf1nz9D8-coa2k2VTyt052pxPF_4Cbdnv-Xg2vUyO8gN_zsBz |
| linkProvider | Directory of Open Access Journals |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Deriving+adaptive+distinguishing+sequences+for+Finite+State+Machines&rft.jtitle=Trudy+Instituta+sistemnogo+programmirovani%C3%A2&rft.au=A.+S.+Tvardovskii&rft.au=N.+V.+Yevtushenko&rft.date=2018-10-01&rft.pub=Russian+Academy+of+Sciences%2C+Ivannikov+Institute+for+System+Programming&rft.issn=2079-8156&rft.eissn=2220-6426&rft.volume=30&rft.issue=4&rft.spage=139&rft.epage=154&rft_id=info:doi/10.15514%2FISPRAS-2018-30%284%29-9&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_a254e69ff3354fedbba8956d26ed0fb1 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2079-8156&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2079-8156&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2079-8156&client=summon |