Minimizing Coordination Channels in Distributed Testing

DOI10.1007/11888116_32MaRDI QIDQ3613091zbMATH OpenOpenAlexFDO

Authors Guy-Vincent Jourdan, Hasan Ural, Hüsnü Yenigün

Publication date 11 March 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11888116_32

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• Overcoming controllability problems with fewest channels between testers
• Constructing checking sequences for distributed testing
• Checking sequences for distributed test architectures
• Distributed testing without encountering controllability and observability problems
• Formal Techniques for Networked and Distributed Systems - FORTE 2005

Cites work

• Augmentation Problems
• Coordination algorithm for distributed testing
• Depth-First Search and Linear Graph Algorithms
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• Formal Techniques for Networked and Distributed Systems – FORTE 2004
• scientific article; zbMATH DE number 3254909 (Why is no real title available?)
• On minimizing the lengths of checking sequences
• Overcoming observability problems in distributed test architectures
• Reduced length checking sequences
• The synchronization problem in protocol testing and its complexity

Cited in

(4)

• Overcoming controllability problems with fewest channels between testers
• Coordination algorithm for distributed testing
• scientific article; zbMATH DE number 1931736 (Why is no real title available?)
• Testing for coordination fidelity

This page was built for publication: Minimizing Coordination Channels in Distributed Testing

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