Failure mode modular de-composition using spider diagrams

MaRDI QIDQ2848464zbMATH OpenFDO

Authors R. P. Clark

Publication date 26 September 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066105050401

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• scientific article; zbMATH DE number 1179831
• scientific article; zbMATH DE number 1670606
• Automated theorem proving with spider diagrams
• Diagrammatic Representation and Inference
• scientific article; zbMATH DE number 3930360

Cited in

(4)

• On the completeness of spider diagrams augmented with constants
• A graph theoretic approach to general Euler diagram drawing
• Efficient on-line algorithms for Euler diagram region computation
• Automated theorem proving in Euler diagram systems

This page was built for publication: Failure mode modular de-composition using spider diagrams

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