Checking sequences for distributed test architectures
From MaRDI portal
Publication:2377256
Recommendations
Cites work
- A Method for the Design of Fault Detection Experiments
- Coordination algorithm for distributed testing
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- Formal Techniques for Networked and Distributed Systems – FORTE 2004
- scientific article; zbMATH DE number 3254909 (Why is no real title available?)
- On minimizing the lengths of checking sequences
- Overcoming observability problems in distributed test architectures
- Reduced length checking sequences
- The synchronization problem in protocol testing and its complexity
- Using a minimal number of resets when testing from a finite state machine
Cited in
(10)- 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
- Constructing checking sequences for distributed testing
- Detecting Observability Problems in Distributed Testing
- Minimizing Coordination Channels in Distributed Testing
- scientific article; zbMATH DE number 2013782 (Why is no real title available?)
- Formal Techniques for Networked and Distributed Systems – FORTE 2004
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
This page was built for publication: Checking sequences for distributed test architectures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2377256)