166 research outputs found
Diagnosability of Fuzzy Discrete Event Systems
In order to more effectively cope with the real-world problems of vagueness,
{\it fuzzy discrete event systems} (FDESs) were proposed recently, and the
supervisory control theory of FDESs was developed. In view of the importance of
failure diagnosis, in this paper, we present an approach of the failure
diagnosis in the framework of FDESs. More specifically: (1) We formalize the
definition of diagnosability for FDESs, in which the observable set and failure
set of events are {\it fuzzy}, that is, each event has certain degree to be
observable and unobservable, and, also, each event may possess different
possibility of failure occurring. (2) Through the construction of
observability-based diagnosers of FDESs, we investigate its some basic
properties. In particular, we present a necessary and sufficient condition for
diagnosability of FDESs. (3) Some examples serving to illuminate the
applications of the diagnosability of FDESs are described. To conclude, some
related issues are raised for further consideration.Comment: 14 pages; revisions have been mad
A general theorem for degree-reduction of a digital BR function
A general theorem is developed for the degree reduction of a bounded real (BR) digital filter transfer function, and is related to the extraction of a digital lossless two-pair from a BR function in such a manner that the remainder function is reduced order BR. The theorem finds applications in the synthesis of digital filter transfer functions in the form of a cascade of lossless two pairs
Extra Connectivity of Strong Product of Graphs
The - of a connected graph is
the minimum cardinality of a set of vertices, if it exists, whose deletion
makes disconnected and leaves each remaining component with more than
vertices, where is a non-negative integer. The of graphs and is the graph with vertex set , where two distinct vertices are adjacent in if and only if and or
and or and . In this paper, we give the - of
, where is a maximally connected -regular graph for . As a byproduct, we get -
conditional fault-diagnosability of under model
A Local Diagnosis Algorithm for Hypercube-like Networks under the BGM Diagnosis Model
System diagnosis is process of identifying faulty nodes in a system. An
efficient diagnosis is crucial for a multiprocessor system. The BGM diagnosis
model is a modification of the PMC diagnosis model, which is a test-based
diagnosis. In this paper, we present a specific structure and propose an
algorithm for diagnosing a node in a system under the BGM model. We also give a
polynomial-time algorithm that a node in a hypercube-like network can be
diagnosed correctly in three test rounds under the BGM diagnosis model
- β¦