Synchronization paradigm for protocol testing under multiparty configuration
From MaRDI portal
Publication:1963369
DOI10.1016/S0898-1221(99)00093-0zbMATH Open0953.68008OpenAlexW2095202636MaRDI QIDQ1963369FDOQ1963369
Authors: Rong S. Lin, Maria C. Yuang
Publication date: 26 January 2000
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0898-1221(99)00093-0
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
- A note on two problems in connexion with graphs
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Testing Software Design Modeled by Finite-State Machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Automata Studies. (AM-34)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The synchronization problem in protocol testing and its complexity
- Computing the optimal IO sequences of a protocol in polynomial time
Cited In (5)
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)