The complexity of checking the existence and derivation of adaptive synchronizing experiments for deterministic FSMs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Information Processing Letters Année : 2017

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

Résumé

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
Fichier non déposé

Dates et versions

hal-01611545 , version 1 (06-10-2017)

Identifiants

Citer

Husnu Yenigun, Nina Yevtushenko, Natalia Kushik. The complexity of checking the existence and derivation of adaptive synchronizing experiments for deterministic FSMs. Information Processing Letters, 2017, 127, pp.49 - 53. ⟨10.1016/j.ipl.2017.07.001⟩. ⟨hal-01611545⟩
45 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More