Parallel Verification Systems for Highly-Complex Communications Protocols

适用于高度复杂通信协议的并行验证系统

• 批准号: 9109804
• 负责人: Ophir Frieder
• 金额: $ 5.5万
• 依托单位: George Mason University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1991
• 资助国家: 美国
• 起止时间: 1991-09-01 至 1994-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9109804&HistoricalAwards=false
• 关键词: Parallel; Verification; Systems; Highly; Complex

The objective of this project is to develop methods for the verification of highly complex communications protocol required for current and future network engineering problems. The problem of protocol verification is computationally complex. This research focuses on ways to employ scalable parallelism to provide the necessary computational resources. Initial research has been conducted on parallel protocol verification algorithms based on the relational algebra. The project will expand on the earlier work by applying two level parallelism. New algorithms will be developed and implemented on an Intel iPSC/2 hypercube. This project will also investigate the specification and parallel verification of protocols written in Communicating Sequential Processes (CSP). A prototype system will be developed.

该项目的目标是制定方法， 核查所需的高度复杂的通信协议， 当前和未来的网络工程问题。 的问题 协议验证在计算上是复杂的。 本研究 重点介绍采用可扩展并行性来提供 必要的计算资源。 最初的研究已经 的并行协议验证算法 关系代数 该项目将在早期工作的基础上扩大， 应用两级并行。 将开发新的算法， 在Intel iPSC/2超立方体上实现。 该项目还将 研究协议的规范和并行验证 通信顺序进程（CSP） 一个原型 系统将开发。