Finite-state machine embeddings for nonconcurrent error detection and identification
AuthorHadjicostis, Christoforos N.
SourceIEEE Transactions on Automatic Control
Google Scholar check
MetadataShow full item record
In digital sequential systems that operate over several time steps, a state-transition fault at any time step during the operation of the system can corrupt its state and render its future functionality useless. Such state-transition faults are usually handled by embedding the given sequential system into a larger one, in a way that preserves the state evolution and properties of the original system while enabling an external mechanism to perform checks to detect, identify and correct errors in the encoded state of this redundant system. Checking is typically performed concurrently (i.e., at the end of each time step) and can potentially cause high power consumption or an overall slowdown in the system; more importantly, concurrent checking imposes significant reliability requirements on the error-detection/identification mechanism. In this paper, we develop a methodology for systematically constructing embeddings of finite-state machines so that the external mechanism can capture transient state-transition faults via checks that are performed in a nonconcurrent manner (e.g., periodically instead of every time step). More specifically, by characterizing nonconcurrent error-detecting/identifying capabilities in terms of state encoding constraints and redundant dynamics, the proposed approach can be used to construct a redundant version of the given finite-state machine (FSM) that allows the external mechanism to detect and identify errors due to past state-transition faults based on an analysis of the current, possibly corrupted FSM state. As a result, the checker in such designs can operate at a slower speed than the rest of the system which relaxes the stringent requirements on its reliability. © 2005 IEEE.
Showing items related by title, author, creator and subject.
Fernández Anta, A.; Georgiou, Chryssis; Kowalski, D. R.; Widmer, J.; Zavou, Elli (2016)In this paper, we explore the problem of achieving efficient packet transmission over unreliable links with worst-case occurrence of errors. In such a setup, even an omniscient offline scheduling strategy cannot achieve ...
Hibey, J. L.; Charalambos, C. D. (1999)Nonlinear stochastic differential equations are used to model a version of the changepoint problem. State estimates of the minimum mean-square-error-type are used in likelihood-ratio tests to detect the time of change. ...
Directly computable L2 and Lx performance bounds for Morse's dynamic certainty equivalence adaptive controller Datta, Aniruddha; Ioannou, Petros A. (1995)In this paper we consider a model reference adaptive control scheme where the classical error augmentation and standard tuning error normalization are avoided through the use of Morse's high order tuner. We consider the ...