Protocol validation by simultaneous reachability analysis

Computer Communications

Volumn 20, Issue 9, 1997, Pages 772-788

  Özdemir, Kadir ^a   Ural, Hasan ^b  

^a NORTEL NETWORKS   (Canada)

^b UNIVERSITY OF OTTAWA   (Canada)

Author keywords

Protocol validation; Reachability analysis

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); EFFICIENCY; EVALUATION; MATHEMATICAL MODELS; PERFORMANCE;

REACHABILITY;

NETWORK PROTOCOLS;

EID: 0031559616     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0140-3664(97)00075-3     Document Type: Article

References (23)

1. G.V. Bochmann, Finite state description of communication protocols, Computer Networks 2, (1978) 361-372.
2. D. Brand, P. Zafiropulo, On communicating finite state machines, J. ACM 30(2A) (1983) 323-342.
3. T.Y. Choi, R.E. Miller, A decomposition method for the analysis and design of finite state protocols, ACM SIGCOMM'83, 1983, pp. 167-176.
4. A. Finkel, A new class of analyzable CFSMs with unbounded fifo channels, Protocol Specification, Testing and Verification, VIIL, Elsevier, North-Holland, 1988, pp. 283-294.
5. M.G. Gouda, Y.T. Yu, Protocol validation by maximal progress state exploration, IEEE Trans. on Commun. COM-32 (1984) 94-97.
6. M.G. Gouda, Ji-Yun Han, Protocol validation by fair progress state exploration, Computer Networks 9 (1985) 353-361.
7. G.J. Holzmann, An improved protocol reachability analysis technique, Software-Practice and Experience 18(2) (1988) 137-161.
8. M. Itoh, H. Ichikawa, Protocol verification using reduced reachability analysis, The Trans. on the IECE of Japan E66(2) (1983) 88-93.
9. F.I. Lin, P.M. Chu, M.T. Liu, Protocol verification using reachability analysis: The state explosion problem and relief strategies. Computer Communication Review 17(5) (1987) 126-134.
10. H. Liu, R.E. Miller, Generalized fair reachability analysis for cyclic protocols: part 1, Protocol Specfication, Testing and Verification, XIV, Elsevier, North-Holland, 1994, pp. 258-273.
11. N.F. Maxemchuk, K. Sabnani, Probabilistic verification of communication protocols, Protocol Specification, Testing and Verification, VII, Elsevier, North-Holland, 1987, pp. 307-320.
12. J. Pachl, Protocol description and analysis based on a state transition model with channel expression, Protocol Specification, Testing and Verification, VII, Elsevier, North-Holland, 1987, pp. 209-219.
13. W.X. Peng, S. Purushothaman, A unified approach to the deadlock detection problem in networks of communicating finite state machines, CAV'90, Lecture Notes in Computer Science, vol. 531, Springer-Verlag, 1990, pp. 243-252.
14. R. Probert, K. Saleh, Synthesis of communicating protocols: survey and assesment, IEEE Trans. on Computers 40(4) (1991) 468-476.
15. J. Rubin, C.H. West, An improved protocol validation technique, Computer Networks 6 (1982) 65-73.
16. D.P. Sidhu, Protocol design rules, Protocol Specification, Testing and Verification, II, Elsevier, North-Holland, 1982, pp. 283-300.
17. S.T. Vuong, D.D. Cowan, A decomposition method for the validation of structured protocols, INFOCOM'82, 1982, pp. 209-220.
18. C.H. West, General technique for communications protocol validation, IBM J. Res. Develop. 22(1) (1978) 393-404.
19. C.H. West, Protocol verification by random state exploration, Protocol Specification, Testing and Verification, VI, Elsevier, North-Holland, 1986, pp. 233-242.
20. M.C. Yuang, Survey of protocol verification techniques based on finite state machine models, Proc. NBS Computer Networking Symposium, 1988, pp. 164-172.
21. Y.T. Yu, M.G. Gouda, Deadlock detection for a class of communicating finite state machines, IEEE Trans. on Commun. COM-30(12) (1982) 2514-2518.
22. P. Zafiropulo, Protocol validation by duologue-matrix analysis, IEEE Trans. on Commun. COM-26(8) (1978) 1187-1194.
23. Y.X. Zang, K. Takahashi, N. Shiratori, S. Noguchi, An interactive synthesis algorithm using a global state transition graph, IEEE Trans. on Soft. Eng. 14(3) (1988) 394-404.