In this paper, a robust algorithm for fault diagnosis of power system equipment based on a Failure-Sensitive Matrix (FSM) is presented. FSM is a dynamic matrix structure updated by multiple measurements (on-line) and test results (off-line) on the systems. The algorithm uses many different artificial intelligence (AI) and expert system (ES) methods for detecting the location of faults, emerging...

In this paper we consider one of the classical finite state machine (FSM) model modifications FSM with time-outs (or timed FSM). In this model in addition to the ordinary transitions under inputs there are transitions under time-outs when no input is applying. The behavior of many modern systems includes time-outs, for example, mobile phones, etc. In the past few years some work have been carri...

We discuss SPaRe: selective partial replication, a methodology for concurrent fault detection in finite state machine (FSMs). The proposed method is similar to duplication, wherein a replica of the circuit acts as a predictor that immediately detects errors by comparison to the original FSM. However, instead of duplicating the FSM, SPaRe selects a few prediction functions which only partially r...

R sum This paper presents a new database model, namely Fuzzy Semantic Model (or FSM). FSM enables us to capture effectively the fuzziness and semantics of real-world and provides tools for its formalization and conceptualization within a manner adapted to human perception and reasoning. One of the novelties of FSM is that it authorizes an entity to be a member of several classes at the same tim...

This paper proposes a practical coding scheme for the Slepian-Wolf problem of separate encoding of correlated sources. Finite-state machine (FSM) encoders, concatenated in parallel, are used at the transmit side and an iterative turbo decoder is applied at the receiver. Simulation results of system performance are presented for binary sources with different amounts of correlation. Obtained resu...

[Background of this unusual double interview: the Free Software Magazine (http:// www.freesoftwaremagazine.com) and the TEX Users Group (TUG) both like to publish interviews. By chance, Gianluca Pignalberi of FSM and Dave Walden of TUG both approached Frank Mittelbach about interviewing him around the same time. Rather than doing two separate interviews, Mittelbach, Pignalberi, and Walden decid...

We address a problem of nding a nite state machine (FSM), which composed with a given FSM, satisses a given speciication. The composition we use is the standard synchronous automata composition restricted to cases which correctly model hardware interconnection. For the satisfaction relation, we use language containment. We present a procedure that will generate a solution (if one exists) which ...

Constrained encoding has several applications in the synthesis of finite state machines (FSMs). E.g., it can be used to generate asynchronous FSM state assignment that guarantees a critical hazard-free implementation, or to generate synchronous FSM state assignment with minimum PLA implementation. This paper presents ZEDICHO, an original zero-suppressed binary decision diagram (ZBDD) based algo...

Inspiring and maintaining student participation in large classes can be a difficult task. Students benefit from an active experience as it helps them better understand the course material. However, it’s easy to stay silent. Opportunities to participate in conversation allow students to question and learn. The Fragmented Social Mirror (FSM) provides students with the ability to anonymously initi...

Power-gating turns off the power supply of a portion of the circuit completely, resulting in total elimination of power consumption for that part. However, it also necessitates that the sub-circuit to be activated should be charged for some time before its activation. This critical issue can influence the decomposition of a finite state machine (FSM) for its power gated implementation. In this ...