Show simple item record

dc.contributor.advisorHill, Frederick J.en_US
dc.contributor.authorWang, Tsomg-Niang, 1953-
dc.creatorWang, Tsomg-Niang, 1953-en_US
dc.date.accessioned2013-03-28T10:09:54Z
dc.date.available2013-03-28T10:09:54Z
dc.date.issued1987en_US
dc.identifier.urihttp://hdl.handle.net/10150/276580
dc.description.abstractThis paper describes a Protocol Finite State Machine (PFSM) for implementing communication protocols. Our objective is to develop and implement a general model for communication protocols based on the principles of finite state machines and make the design of transport entity more modular and easier to maintain and modify. We have designed an inference method and knowledge representation, based on semantic networks, for implementing this model. We have added interactive capability and automatic error detection to check for invalid external events and other types of errors in our model. PFSM consists of one or more knowledge bases depicting the state machine model for each communication protocol, an inference engine that uses the knowledge base(s), a working memory, a knowledge acquisition subsystem to gather the data required to build the knowledge base(s), a dialog subsystem to conduct an interactive conversation with the user(s), and an explanation subsystem to explain the inferencing mechanism. (Abstract shortened with permission of author.)
dc.language.isoen_USen_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en_US
dc.subjectExpert systems (Computer science)en_US
dc.subjectComputer networks.en_US
dc.subjectInteractive computer systems.en_US
dc.titleA modular prolog representation of a TCP protocol finite state machineen_US
dc.typetexten_US
dc.typeThesis-Reproduction (electronic)en_US
dc.identifier.oclc20066074en_US
thesis.degree.grantorUniversity of Arizonaen_US
thesis.degree.levelmastersen_US
dc.identifier.proquest1332430en_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.disciplineElectrical and Computer Engineeringen_US
thesis.degree.nameM.S.en_US
dc.identifier.bibrecord.b16917303en_US
refterms.dateFOA2018-04-25T14:49:45Z
html.description.abstractThis paper describes a Protocol Finite State Machine (PFSM) for implementing communication protocols. Our objective is to develop and implement a general model for communication protocols based on the principles of finite state machines and make the design of transport entity more modular and easier to maintain and modify. We have designed an inference method and knowledge representation, based on semantic networks, for implementing this model. We have added interactive capability and automatic error detection to check for invalid external events and other types of errors in our model. PFSM consists of one or more knowledge bases depicting the state machine model for each communication protocol, an inference engine that uses the knowledge base(s), a working memory, a knowledge acquisition subsystem to gather the data required to build the knowledge base(s), a dialog subsystem to conduct an interactive conversation with the user(s), and an explanation subsystem to explain the inferencing mechanism. (Abstract shortened with permission of author.)


Files in this item

Thumbnail
Name:
azu_td_1332430_sip1_m.pdf
Size:
1.508Mb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record