Checking sequences for distributed test architectures
From MaRDI portal
Publication:2377256
DOI10.1007/s00446-008-0062-4zbMath1267.68067MaRDI QIDQ2377256
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
testing; coordination problems; checking sequence; distributed test architecture; observability problems
68M15: Reliability, testing and fault tolerance of networks and computer systems
68W15: Distributed algorithms
Related Items
Canonical finite state machines for distributed systems, 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
Uses Software
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