The synchronization problem in protocol testing and its complexity

DOI10.1016/0020-0190(91)90166-FzbMath0745.68024MaRDI QIDQ1183455

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)

Related Items (10)

Checking sequences for distributed test architectures ⋮ Overcoming observability problems in distributed test architectures ⋮ Implementation relations and test generation for systems with distributed interfaces ⋮ Overcoming controllability problems in distributed testing from an input output transition system ⋮ Using schedulers to test probabilistic distributed systems ⋮ Synchronization paradigm for protocol testing under multiparty configuration ⋮ Timed implementation relations for the distributed test architecture ⋮ Minimizing Coordination Channels in Distributed Testing ⋮ Distributed testing without encountering controllability and observability problems ⋮ Canonical finite state machines for distributed systems

Cites Work

• Matching, Euler tours and the Chinese postman
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item

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