Checking sequences for distributed test architectures

DOI10.1007/S00446-008-0062-4zbMath1267.68067OpenAlexW2034873526MaRDI QIDQ2377256

Hasan Ural, Robert M. Hierons

Publication date: 28 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: http://bura.brunel.ac.uk/handle/2438/1869

zbMATH Keywords

testingcoordination problemschecking sequencedistributed test architectureobservability problems

Mathematics Subject Classification ID

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

Related Items (4)

Implementation relations and test generation for systems with distributed interfaces ⋮ Overcoming controllability problems in distributed testing from an input output transition system ⋮ Timed implementation relations for the distributed test architecture ⋮ Canonical finite state machines for distributed systems

Uses Software

• AsmL

Cites Work

• Unnamed Item
• Overcoming observability problems in distributed test architectures
• The synchronization problem in protocol testing and its complexity
• Coordination algorithm for distributed testing
• Using a minimal number of resets when testing from a finite state machine
• On minimizing the lengths of checking sequences
• Reduced length checking sequences
• Formal Techniques for Networked and Distributed Systems – FORTE 2004
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• A Method for the Design of Fault Detection Experiments

This page was built for publication: Checking sequences for distributed test architectures