A unified approach to the problem of fault diagnosis is considered for the cases of continuous-time and discrete-time nonlinear and linear system models as well as for discrete-event model. The feature of this approach is that it allows obtaining the unique on the algorithmic level solution of the problem for all above types of the models. Conventional differential geometric and pair algebra of partitions tools are applied as auxiliary ones for providing the calculations in special model cases.

background

Algebraic Structure Theory of Sequential Machines

Unified approach to the problem of fault diagnosis

This paper addresses the issue of modelling and analysis of systems. The necessity of 
carrying out verification and/or validation tasks is discussed, the factors which influence 
the choice of a model are shown, and the differences between simulation tools or formal 
methods is explained. Within the framework of discrete time modelling of systems, a 
method for formally analysing the behaviour of a system described by a Finite State 
Machine permits to prove properties: the method is based on the translation into a formal 
system which has got a temporal logic interpretation, and the analysis of the sensitivity 
of the temporal evolution of the system with respect to some events involves the use of 
the Temporal Boolean Difference. Furthermore, in order to improve the expressiveness 
power of the model, an extension of the Finite State Machine model, called Interpreted 
Sequential Machine (lSM) supports the representation of complex data. The verification 
process has been adapted to t his model.

The ism: a formal tool for modelling and verification

Automata in categories. The decomposition problem

The opportunities created by modern microelectronic technology cannot be effectively exploited, because of weaknesses of the traditional circuit synthesis methods used in today's CAD tools. In this paper, a new information-driven circuit synthesis method is discussed. It differs considerably from all other known methods. It is based on our original information-driven approach to circuit synthesis, bottom-up general functional decomposition and theory of information relationship measures. A special focus of the paper is on the role and usage of information trans-coders in the information-driven circuit synthesis. The experimental results from the automatic circuit synthesis tool that implements the method demonstrate that the information-driven general decomposition produces very fast and compact gate-based circuits, and the information trans-coders play an important role in achieving this aim.

Algebraic Structure Theory of Sequential Machines

Citations

Unified approach to the problem of fault diagnosis

The ism: a formal tool for modelling and verification

Automata in categories. The decomposition problem

Information trans-coders in information-driven circuit synthesis

State Space Representation of a General Time System

Related Papers (5)

Switching and Finite Automata Theory

Optimal State Assignment for Finite State Machines

MIS: A Multiple-Level Logic Optimization System

Introduction to Automata Theory, Languages, and Computation

Logic Minimization Algorithms for VLSI Synthesis