Adaptive Homing is in P
Homing preset and adaptive experiments with Finite State Machines (FSMs) are widely used when a non-initialized discrete event system is given for testing and thus, has to be set to the known state at the first step. The length of a shortest homing sequence is known to be exponential with respect to...
Main Authors: | Natalia Kushik, Nina Yevtushenko |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2015-04-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1504.02444v1 |
Similar Items
-
Deriving Synchronizing and Homing Sequences for Input/Output Automata
by: Natalia G. Kushik, et al.
Published: (2017-12-01) -
The effect of partiality and adaptivity on the complexity of FSM state identification problems
by: H. Yenigun, et al.
Published: (2018-10-01) -
Deriving Homing Sequences for Finite State Machines with Timed Guards
by: Aleksandr Sergeevich Tvardovskii, et al.
Published: (2020-12-01) -
A TEFSM-based Framework for QoE Evaluation of OTT Services
by: D. Rivera, et al.
Published: (2018-10-01) -
Checking experiments with non-observable tree FSMs
by: N. . Kushik
Published: (2018-10-01)