Parallel Verification Systems for Highly-Complex Communications Protocols

该项目的目标是开发验证当前和未来网络工程问题所需的高度复杂通信协议的方法。协议验证问题在计算上是复杂的。本研究的重点是如何使用可扩展的并行性来提供必要的计算资源。对基于关系代数的并行协议验证算法进行了初步研究。该项目将通过应用两级并行来扩展早期的工作。新的算法将在英特尔iPSC/2超立方体上开发和实现。该项目还将研究在通信顺序进程（CSP）中编写的协议的规范和并行验证。将开发一个原型系统。

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.