The synchronization problem in protocol testing and its complexity

DOI10.1016/0020-0190(91)90166-FMaRDI QIDQ1183455zbMATH OpenFDO

Authors Sylvia Boyd, Hasan Ural

Publication date 28 June 1992

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

protocol conformance testingsyncronizable test sequences

Mathematics Subject Classification ID

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

Recommendations

• Synchronization paradigm for protocol testing under multiparty configuration
• On the complexity of generating synchronizable test sequences
• Implementation of the algorithm for testing an automaton for synchronization in linear expected time
• Synchronizability for Verification of Asynchronously Communicating Systems
• Semicomputable points in Euclidean spaces
• On the Complexity of Network Synchronization
• Algorithms and Computation
• Complexity of network synchronization

Cites work

• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3231691 (Why is no real title available?)
• scientific article; zbMATH DE number 3254909 (Why is no real title available?)
• Depth-First Search and Linear Graph Algorithms
• Matching, Euler tours and the Chinese postman

Cited in

(14)

• Canonical finite state machines for distributed systems
• scientific article; zbMATH DE number 2088428 (Why is no real title available?)
• The complexity of checking the existence and derivation of adaptive synchronizing experiments for deterministic FSMs
• Minimizing Coordination Channels in Distributed Testing
• The relation between preset distinguishing sequences and synchronizing sequences
• Synchronization paradigm for protocol testing under multiparty configuration
• On the complexity of generating synchronizable test sequences
• Distributed testing without encountering controllability and observability problems
• Implementation relations and test generation for systems with distributed interfaces
• Overcoming controllability problems in distributed testing from an input output transition system
• Overcoming observability problems in distributed test architectures
• Using schedulers to test probabilistic distributed systems
• Checking sequences for distributed test architectures
• Timed implementation relations for the distributed test architecture

This page was built for publication: The synchronization problem in protocol testing and its complexity

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