Call for Paper - March 2023 Edition
IJCA solicits original research papers for the March 2023 Edition. Last date of manuscript submission is February 20, 2023. Read More

Using Knowledge-based System Techniques in the Protocol Design Process

International Journal of Computer Applications
© 2011 by IJCA Journal
Volume 35 - Number 6
Year of Publication: 2011
M. Nawaz Brohi

Nawaz M Brohi. Article: Using Knowledge-based System Techniques in the Protocol Design Process. International Journal of Computer Applications 35(6):28-37, December 2011. Full text available. BibTeX

	author = {M. Nawaz Brohi},
	title = {Article: Using Knowledge-based System Techniques in the Protocol Design Process},
	journal = {International Journal of Computer Applications},
	year = {2011},
	volume = {35},
	number = {6},
	pages = {28-37},
	month = {December},
	note = {Full text available}


This paper describes the knowledge-based system techniques, such as program transformation and artificial intelligence techniques, used to design a reliable protocol. Program transformation techniques can be used in deriving protocol specifications. AI techniques, such as search algorithms and theorem proving, can be used to reduce the global space search. AI techniques can also be used to help correctness proving in protocol validation and verification. This study is based on the Alternative Bit Protocol (ABP).


  • Denning, D. E. 1987. “An Intrusion Detection Model,” IEEE Trans Software Eng 13(2): 222 232.
  • Karthikeyan, B., Davor, O. and Carl, A.G. 2002. “Formal verification of standards for distance vector routing protocols,” JACM, 49 (4):538-576.
  • Sunshine, C.A. 1979. “Formal techniques for protocol specification and verification,” IEEE Computer Magazine 12(9):20-27.
  • West C.H. 1978. “An automated technique of communications protocol validation,” IEEE Trans Comm. 26(8):1271–1275.
  • West, C.H. 1982. “Applications and limitations of automated protocol validation,” Proc. 2nd IFIP WG 6.1:361-373.
  • Vuong, S. T. and Cowan, D. D. 1982. “Reachability Analysis of Protocols with non-FIFO Channels,” Proc. COMPCON: 49-57.
  • Choi, T.Y., and Miller, R.E. 1983. “A decomposition method for the analysis and design of finite state protocols,” Proc. ACM/IEEE Data Comm: 167-176.
  • Chow, C.H. 1985. “A discipline for the verification and modular construction of communication Protocols,” Ph.D. dissertation, University of Texas, Austin Texas.
  • Lam, S.S., and Shankar, A.U. 1984. “Protocol Verification via projections,” IEEE Trans Software Eng 10(4):325-342.
  • Blumer, T.P., and Sidhu, D.P. 1986. “Mechanical verification and automatic implementation of communication protocols,” IEEE Trans Software Eng.12 (8):827-842.
  • Ansart, J.P. 1985. “Issues and tools for protocol specification. In Distributed Systems, Methods and Tools for Specification,” Springer Verlag, Berlin Germany: 481-538.
  • Rudin, H., and West, C.H. 1982. “An improved protocol validation technique,” Computer Networks 6(2):65-73.
  • Gouda, M.G., and Han, J.Y. 1985. “Protocol validation by fair progress state exploration,” Computer Networks & ISDN Systems 9:353-361.
  • Zhao, J.R., and Bochmann, G. V. 1986. “Reduced reachability analysis of communication protocols: a new approach,” 6th Int’l Workshop on PSTV: 234-254.
  • Gouda, M.G. and Yu, Y.T. 1984. “Protocol validation by maximal progress state exploration,” IEEE Trans Comm. 32(1):94-97.
  • Gouda, M.G., and Yu, Y.T. 1984. “Synthesis of Communicating Finite-State Machines with guaranteed progress,” IEEE Trans Comm. 32(7):779-788.
  • Itoh, M., and Ichikawa, H. 1983. “Protocol verification algorithm using reduced reachability analysis,” Trans. of IEICE Tran E66 (2):88-93.
  • Brand, D., and Zafiropulo, P. 1983. “On Communicating finite state machines,” J ACM 30(2):323-342.
  • Kakuda, Y., Wakahara, Y., and Norigoe, M. 1986. “A new algorithm for fast protocol validation,” Proc. IEEE COMPSAC: 228-236.
  • Holzmann, G.J. 1985. “Tracing Protocols,” AT&T Tech. Jour. 64(10):2413-2434.
  • Holzmann, G.J. 1987. “Automatic protocol validation in Argos, assertion proving and scatter searching,” IEEE Trans Software Eng 13(6):683-696.
  • West, C.H. 1986. “Protocol Validation by Random State Exploration,” Proc. 6th IFIP WG 6.1:233-242.
  • Vuong, S.T., Hui D.D., and Cowan, D.D. 1986. “Valira - A Tool for Protocol Validation via Reachability Analysis,” Proc. 6th Workshop on PSTV: 35-42.
  • Lu, C.S. 1986. “Automated validation of communication protocols,” Ph.D. dissertation, Ohio State University, Columbus, Ohio.
  • Purushothaman, S., and Subrahmanyam, P.A. 1987. “Reasoning about probabilistic behavior in concurrent systems,” IEEE Trans Software Eng 13(6):740-745.
  • Lin, F.J., Chu, P.M., and Liu, M.T. 1987. “Protocol verification using reachability analysis: the state explosion problem and relief strategies,” Proc. ACM SIGCOMM 17(5):126-135.
  • Bylander. T, Mittal.S. 1986. “CRSL: A Language for Classificatory Problem Solving and Uncertainty Handling,” AI Magazine 7(3):66-77.
  • Mostow, J. 1985. “Toward Better Models of the Design Process,” AI Magazine 6(1):44-57.
  • Mostow, J. 1985. “Foreword What is AI? And what Does It Have to Do with Software Engineering?” IEEE Trans Software Eng 11(11): 1253-1256.
  • Simon, H.A. 1986. “Whether Software Engineering Needs to be Artificially Intelligent,” IEEE Trans Software Eng 12 (7): 726-732.
  • Balzer, R. 1985. “A 15 Year Perspective on Automatic Programming,” IEEE Trans Software Eng 11(11):1257-