Finite State Machine Fault Detection via Transition Validation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for detecting faults in finite-state machines (FSMs) are inadequate, particularly in safety-critical systems, as they struggle to efficiently identify and differentiate between transient and stuck-at faults, which can be difficult to detect and may lead to safety standards non-compliance.
Innovation Solution
A computer-implemented method and processing module that determine whether a set of transitions in an FSM is allowable by comparing it with predefined sets of transitions, allowing for the identification of faults, including stuck-at faults, by determining unallowable transitions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If redundancy is added to the hardware to mitigate random hardware faults, then reliability is improved, but silicon area and power consumption increase
Solution Approach 1:
The patent creates a copy of the transition table data from the FSM design phase and stores it in a separate data structure (such as a lookup table or database) that can be independently queried during runtime. This copying approach allows fault detection without duplicating the entire FSM hardware, thereby maintaining reliability while minimizing silicon area overhead.
2Reliability
If Logic-BIST methods are used to perform self-tests on hardware, then reliability is improved, but silicon area and implementation cost increase
Solution Approach 1:
The patent extracts the fault detection function from the FSM operational logic by separating transition validation into an independent query mechanism. Instead of embedding test logic within the FSM state transitions, the solution pulls out transition table data and creates a separate verification layer that queries this data, thereby reducing hardware complexity while maintaining reliability.
Solution Approach 2:
The patent introduces an intermediary data structure (such as a lookup table or database containing the transition table) that mediates between the FSM operational logic and the fault detection mechanism. This intermediary allows the system to verify transitions without direct hardware intervention, reducing implementation complexity while preserving fault detection capability.
3Measurement precision
If comprehensive hardware testing is performed to detect faults, then measurement precision is improved, but loss of time increases
Solution Approach 1:
The patent performs preliminary action by pre-computing and storing the complete transition table data during the FSM design phase. This pre-prepared data structure enables runtime fault detection to proceed through simple queries rather than comprehensive testing, thereby maintaining high measurement precision while minimizing loss of time during actual operation.
Data Source
AI summary
A computer-implemented method and a processing module for identifying that a fault has occurred in a finite-state machine (FSM). It is determined whether a set of one or more transitions that have occurred between states of the FSM is allowable. In response to determining that the set of one or more transitions is not allowable, it is identified that a fault has occurred in the FSM.