Diagnosability of Two-Matching Composition Networks (Q3511359)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Diagnosability of Two-Matching Composition Networks	scientific article

Statements

scholarly article

0 references

Diagnosability of Two-Matching Composition Networks (English)

0 references

0 references

0 references

Lecture Notes in Computer Science

0 references

publication date

10 July 2008

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-540-69733-6_47

0 references

Fault Diagnosis in a Boolean n Cube Array of Microprocessors

0 references

A simple proof for the constructions of optical priority queues

0 references

Augmented cubes

0 references

On Fault Identification in Diagnosable Systems

0 references

Diagnosis of ${t / {(t + 1)}}$-Diagnosable Systems

0 references

Optimization of Reduced Dependencies for Synchronous Sequential Machines

0 references

On self-diagnosable multiprocessor systems: diagnosis by the comparison approach

0 references

Sequential fault occurrence and reconfiguration in system level diagnosis

0 references

A Generalized Theory for System Level Diagnosis

0 references

On diagnosability of large fault sets in regular topology-based computer systems

0 references

Diagnosability of hypercubes and enhanced hypercubes under the comparison diagnosis model

0 references

On Fault Isolation and Identification in t<sub>1</sub>/t<sub>1</sub>-Diagnosable Systems

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-540-69733-6_47

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3511359

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3511359&oldid=35063368"