Optimized Synthesis of Concurrently Checked Controllers
IEEE Transactions on Computers
Fault detection with multiple observers
IEEE/ACM Transactions on Networking (TON)
Model-based diagnosis of communication protocols
Model-based diagnosis of communication protocols
Observer-A Concept for Formal On-Line Validation of Distributed Systems
IEEE Transactions on Software Engineering
Concurrent Error Detection Using Watchdog Processors-A Survey
IEEE Transactions on Computers
Concurrent Process Monitoring with No Reference Signatures
IEEE Transactions on Computers
A robust transport protocol for run-time fault detection
ICNP '95 Proceedings of the 1995 International Conference on Network Protocols
An Approach to Concurrent Control Flow Checking
IEEE Transactions on Software Engineering
Self-checking sequential circuits with self-healing ability
Proceedings of the 12th ACM Great Lakes symposium on VLSI
A hybrid hardware--software technique to improve reliability in embedded processors
ACM Transactions on Embedded Computing Systems (TECS)
Research: Signature-based method for run-time fault detection in communication protocols 1
Computer Communications
| Hi-index | 0.00 |
Leveugle (1990) addressed the problem of reducing the overhead of online testing in dedicated controllers. He introduced a low-overhead technique that allows the detection of illegal paths in finite state machines. Based on Leveugle's idea for detecting illegal paths, we introduce a new simple signature function. This signature function can be efficiently implemented in software. The assignment of values to the states is carried out algebraically by matrix inversion instead of using exhaustive search methods. We show that signatures computed using MISR or checksum are particular cases of our more general signature function. Thus, the state assignment problem can be solved more efficiently. Then, we address the problems of latency and checking from a formal perspective and show that finding the smallest set of checking states (i.e., states where the static signature as compared with the run-time signature) that induces a latency less than or equal to a given value L is NP-hard and there exists no polynomial time algorithm that solves this problem unless P=NP.