Scientific foundations to the multilevel method
TL;DR: This paper proves that the multilevel method (M method) is capable of diagnosing any number of faults in the higher level subgraph(s), if the basic subgraph is error-free, and compares it with other fault detection and fault diagnostic methods.
Abstract: Conformance testing of protocols is the process of checking whether an implementation under test conforms to the standards. In this paper we prove that the multilevel method (M method) [which splits the specification graph into a basic subgraph and one or more higher level subgraph(s)] is capable of diagnosing any number of faults in the higher level subgraph(s), if the basic subgraph is error-free. Heuristics for obtaining the basic subgraph and higher level subgraphs from the specification graph are also given. The advantage of the M method is that it has error recovery and, in addition, it does not assume the presence of reliable reset in the implementation under test. We additionally propose an incremental test sequence generation method, which produces a shorter test sequence and whose fault coverage is same as that of the M method. Finally, we compare the M method with other fault detection and fault diagnostic methods.
Citations
More filters
Journal Article•
TL;DR: A test sequence generated by the procedure given here tours all state transitions and uses a unique signature for each state, called the Unique Input/Output (UIO) sequence, called an input/output behavior that is not exhibited by any other state.
430 citations
TL;DR: Graph Theory with Applications to Engineering and Computer as mentioned in this paper is an excellent introductory treatment of graph theory and its applications that has had a long life in the instruction of advanced undergraduates and graduate students in all areas that require knowledge of this subject.
Abstract: Graph Theory with Applications to Engineering and Computer ... This outstanding introductory treatment of graph theory and its applications has had a long life in the instruction of advanced undergraduates and graduate students in all areas that require knowledge of this subject. The first nine chapters constitute an excellent overall introduction, requiring only some knowledge of set theory and matrix algebra.
16 citations
References
More filters
Book•
01 Jan 2010TL;DR: Theories are made easier to understand with 200 illustrative examples, and students can test their understanding with over 350 end-of-chapter review questions.
Abstract: Understand the structure, behavior, and limitations of logic machines with this thoroughly updated third edition. Many new topics are included, such as CMOS gates, logic synthesis, logic design for emerging nanotechnologies, digital system testing, and asynchronous circuit design, to bring students up-to-speed with modern developments. The intuitive examples and minimal formalism of the previous edition are retained, giving students a text that is logical and easy to follow, yet rigorous. Kohavi and Jha begin with the basics, and then cover combinational logic design and testing, before moving on to more advanced topics in finite-state machine design and testing. Theory is made easier to understand with 200 illustrative examples, and students can test their understanding with over 350 end-of-chapter review questions.
1,315 citations
Book•
01 Jan 1974
1,204 citations
Book•
01 Jan 1974
TL;DR: This outstanding introductory treatment of graph theory and its applications has had a long life in the instruction of advanced undergraduates and graduate students in all areas that require knowledge of this subject.
1,161 citations
01 Oct 1975
TL;DR: Graph Theory and Its Applications to Problems of Society and its Applications to Algorithms and Computer Science.
Abstract: Introductory Graph Theory with ApplicationsGraph Theory with ApplicationsResearch Topics in Graph Theory and Its ApplicationsChemical Graph TheoryMathematical Foundations and Applications of Graph EntropyGraph Theory with Applications to Engineering and Computer ScienceGraphs Theory and ApplicationsQuantitative Graph TheoryApplied Graph TheoryChemical Graph TheoryA First Course in Graph TheoryGraph TheoryGraph Theory with ApplicationsGraph Theory with ApplicationsSpectra of GraphsFuzzy Graph Theory with Applications to Human TraffickingApplications of Graph TheoryChemical Applications of Graph TheoryRecent Advancements in Graph TheoryA Textbook of Graph TheoryGraph Theory and Its Engineering ApplicationsGraph Theory, Combinatorics, and ApplicationsAdvanced Graph Theory and CombinatoricsTopics in Intersection Graph TheoryGraph Theory with Applications to Engineering and Computer ScienceGraph Theory and Its Applications, Second EditionHandbook of Research on Advanced Applications of Graph Theory in Modern SocietyGraph Theory with Applications to Algorithms and Computer ScienceGraph TheoryGraph Theory with Algorithms and its ApplicationsGraph TheoryGraph Theory with ApplicationsGraph Theory ApplicationsHandbook of Graph TheoryGraph Theory and Its Applications to Problems of SocietyBasic Graph Theory with ApplicationsTen
809 citations
"Scientific foundations to the multi..." refers background in this paper
...The number of edges leaving (entering) a node is termed its outdegree(indegree) [8]....
[...]
Journal Article•
TL;DR: A test sequence generated by the procedure given here tours all state transitions and uses a unique signature for each state, called the Unique Input/Output (UIO) sequence, called an input/output behavior that is not exhibited by any other state.
430 citations
"Scientific foundations to the multi..." refers background or methods in this paper
...Unique Input/Output Sequence Method: A unique input/ output (UIO) sequence for a state is denoted by , is an input/output sequence with the originating state such that there is no for which is specified input/output sequence for originating state[21]....
[...]
...This is called thecompleteness assumption [21]....
[...]
...Various test sequence generation methods like transition tour (T), distinguishing sequence (D), characterizing sequence (W), unique input–output (U), extended transition tour (E), regular checking (R), fault resolution (FR), diagnostic approach (DA), and multilevel (M) methods are proposed in the literature [3], [7], [9], [13], [15], [16], [18], [19], [21]....
[...]