Software environment for synthesis of testable FSM through decomposition
Sergei Devadze, Alexander Sudnitson
Abstract
Sergei Devadze, Alexander Sudnitson
Abstract
This paper presents a method and software for constructing of testabie finite state machines (FSM). The proposed method of impiementing test for FSM has severaf advantages in comparison with common soiutions. However, this method imposes some constraints on FSM synthesis process, which can be satisfied by using specific decomposition technique. The presented software environment (caifed D&S) is capabie to perform various kinds of FSM decomposition and synthesis, inciuding the one needed for constructing of testabie FSM.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper presents a method and software for constructing of testabie finite state machines (FSM). The proposed method of impiementing test for FSM has severaf advantages in comparison with common soiutions. However, this method imposes some constraints on FSM synthesis process, which can be satisfied by using specific decomposition technique. The presented software environment (caifed D&S) is capabie to perform various kinds of FSM decomposition and synthesis, inciuding the one needed for constructing of testabie FSM.
Key concepts: Finite-state machine, Computer science, Decomposition, Software, Process (computing), Programming language, Parallel computing, Theoretical computer science