On the complexity of generating synchronizable test sequences

DOI10.1016/0885-064X(92)90006-WMaRDI QIDQ1203646zbMATH OpenFDO

Authors Lung-Tien Liu, Gen-Huey Chen, Ching-Sung Lu

Publication date 22 February 1993

Published in Journal of Complexity (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmconformance testingprotocol engineering\(NP\)- hardminimum-cost synchronizable test sequencetest sequence generation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10)

Recommendations

• The synchronization problem in protocol testing and its complexity
• Synchronization paradigm for protocol testing under multiparty configuration
• Test suite reduction in conformance testing
• Test sequence generation from the protocol data portion based on the selecting Chinese postman algorithm
• Synchronizing asynchronous conformance testing

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• Approximate Traveling Salesman Algorithms
• On general routing problems
• P-Complete Approximation Problems

Cited in

(3)

• The synchronization problem in protocol testing and its complexity
• Synchronization paradigm for protocol testing under multiparty configuration
• Test sequence generation from the protocol data portion based on the selecting Chinese postman algorithm

This page was built for publication: On the complexity of generating synchronizable test sequences

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