Reducing the complexity of checking the existence and derivation of adaptive synchronizing experiments for nondeterministic FSMs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Reducing the complexity of checking the existence and derivation of adaptive synchronizing experiments for nondeterministic FSMs

Résumé

In this paper, we address the problem of setting a discrete system specified as a Finite State Machine (FSM) to a known initial state. As the system behavior can be nondeterministic, we discuss the complexity of problems related to deriving synchronizing sequences for nondeterministic FSMs and propose a way for decreasing such complexity. In fact, we suggest to use adaptive synchronizing sequences instead of preset ones, and prove that for non-initialized nondeterministic FSMs the problem of checking the existence of an adaptive synchronizing sequence is in P.
Fichier non déposé

Dates et versions

hal-01332386 , version 1 (15-06-2016)

Identifiants

Citer

Natalia Kushik, Nina Yevtushenko, Husnu Yenigun. Reducing the complexity of checking the existence and derivation of adaptive synchronizing experiments for nondeterministic FSMs. AMARETTO 2016 : 4th International Workshop on domAin specific Model-based AppRoaches to vErificaTion and validaTiOn, Feb 2016, Rome, Italy. pp.83 - 90, ⟨10.5220/0005854500830090⟩. ⟨hal-01332386⟩
185 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More