Synchronization paradigm for protocol testing under multiparty configuration
From MaRDI portal
Publication:1963369
DOI10.1016/S0898-1221(99)00093-0zbMath0953.68008OpenAlexW2095202636MaRDI QIDQ1963369
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
Cites Work
- A note on two problems in connexion with graphs
- The synchronization problem in protocol testing and its complexity
- Computing the optimal IO sequences of a protocol in polynomial time
- Automata Studies. (AM-34)
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Testing Software Design Modeled by Finite-State Machines
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Synchronization paradigm for protocol testing under multiparty configuration