scientific article; zbMATH DE number 1564050

MaRDI QIDQ4528870zbMATH OpenFDO

Authors V. N. Noskov

Publication date 12 February 2001

zbMATH Keywords

Boolean functioncircuitfault controlinaccuracytest

Mathematics Subject Classification ID

Fault detection; testing in circuits and networks (94C12)

Recommendations

• Verification of Detectability for Unambiguous Weighted Automata
• Verification of detectability in probabilistic finite automata
• scientific article; zbMATH DE number 3322469
• Formal Approaches to Software Testing
• scientific article; zbMATH DE number 2201365
• Reachability problems on reliable and lossy queue automata
• Undecidable problems for probabilistic automata of fixed dimension
• Undecidable verification problems for programs with unreliable channels
• Undecidable verification problems for programs with unreliable channels
• On detectability of labeled Petri nets and finite automata

Cited in

(6)

• An automata-based view on configurability and uncertainty
• scientific article; zbMATH DE number 647612 (Why is no real title available?)
• scientific article; zbMATH DE number 1855662 (Why is no real title available?)
• scientific article; zbMATH DE number 1882358 (Why is no real title available?)
• scientific article; zbMATH DE number 1432382 (Why is no real title available?)
• Transition count testing of automata

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4528870)