The complexity of checking the existence and derivation of adaptive synchronizing experiments for deterministic FSMs

Abstract : In this paper, we address the problem of setting a deterministic Finite State Machine (FSM) to a designated initial state. Differently from other papers, we propose to use adaptive synchronizing sequences (test cases) for this purpose and show that for weakly-connected deterministic complete reduced FSMs the problem of checking the existence of an adaptive synchronizing sequence is in P. For partial deterministic reduced FSMs the problem is PSPACE-complete
Type de document :
Article dans une revue
Information Processing Letters, Elsevier, 2017, 127, pp.49 - 53. 〈10.1016/j.ipl.2017.07.001〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01611545
Contributeur : Médiathèque Télécom Sudparis & Institut Mines Télécom Business School <>
Soumis le : vendredi 6 octobre 2017 - 09:44:53
Dernière modification le : jeudi 11 janvier 2018 - 06:27:35

Identifiants

Citation

Husnu Yenigun, Nina Yevtushenko, Natalia Kushik. The complexity of checking the existence and derivation of adaptive synchronizing experiments for deterministic FSMs. Information Processing Letters, Elsevier, 2017, 127, pp.49 - 53. 〈10.1016/j.ipl.2017.07.001〉. 〈hal-01611545〉

Partager

Métriques

Consultations de la notice

59