Synchronization paradigm for protocol testing under multiparty configuration
From MaRDI portal
Publication:1963369
Recommendations
- The synchronization problem in protocol testing and its complexity
- On the complexity of generating synchronizable test sequences
- scientific article; zbMATH DE number 2088428
- Synchronizing asynchronous conformance testing
- Test sequence generation from the protocol data portion based on the selecting Chinese postman algorithm
Cites work
- scientific article; zbMATH DE number 3266653 (Why is no real title available?)
- scientific article; zbMATH DE number 3298851 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3328721 (Why is no real title available?)
- scientific article; zbMATH DE number 3423954 (Why is no real title available?)
- A note on two problems in connexion with graphs
- Automata Studies. (AM-34)
- Computing the optimal IO sequences of a protocol in polynomial time
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Testing Software Design Modeled by Finite-State Machines
- The synchronization problem in protocol testing and its complexity
Cited in
(5)- The synchronization problem in protocol testing and its complexity
- An optimization technique for protocol conformance testing using multiple UIO sequences
- scientific article; zbMATH DE number 2088428 (Why is no real title available?)
- On the complexity of generating synchronizable test sequences
- Multiparty testing preorders
This page was built for publication: Synchronization paradigm for protocol testing under multiparty configuration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1963369)