首页> 外文OA文献 >A modular prolog representation of a TCP protocol finite state machine
【2h】

A modular prolog representation of a TCP protocol finite state machine

机译:TCP协议有限状态机的模块化序言表示

摘要

This 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.)
机译:本文介绍了用于实现通信协议的协议有限状态机(PFSM)。我们的目标是基于有限状态机的原理开发和实现通信协议的通用模型,并使传输实体的设计更加模块化,并且更易于维护和修改。我们基于语义网络设计了一种推理方法和知识表示,以实现该模型。我们增加了交互功能和自动错误检测功能,以检查模型中是否存在无效的外部事件和其他类型的错误。 PFSM由一个或多个知识库(描述每个通信协议的状态机模型),使用该知识库的推理引擎,工作内存,知识获取子系统来收集构建知识库所需的数据),用于与用户进行互动对话的对话子系统,以及解释推理机制的解释子系统。 (摘要经作者许可缩短。)

著录项

  • 作者

    Wang Tsomg-Niang 1953-;

  • 作者单位
  • 年度 1987
  • 总页数
  • 原文格式 PDF
  • 正文语种 en_US
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号