| 用于描述网络拓扑的形式语言的研究* |
| |
| 引用本文： | 于之硕,杨 静. 用于描述网络拓扑的形式语言的研究*[J]. 软件学报, 1999, 10(2): 210-215 |
| |
| 作者姓名： | 于之硕 杨 静 |
| |
| 作者单位： | 哈尔滨建筑大学计算机应用系,哈尔滨,150008;哈尔滨建筑大学计算机应用系,哈尔滨,150008 |
| |
| 基金项目： | 本文研究得到黑龙江省自然科学基金资助. |
| |
| 摘 要： | 论述了应用随机线性文法及产生式描述计算机网络拓扑结构的方法.在该形式语言的描述中,设置了3个基元状态,通过对基元状态及各种状态规律的分析,准确地描述了网络中结点间通信及共享存储器的状态.同时,证明了用此方法在某种条件下从初始结点到终了结点间可以建立惟一的访问路径,并能避免冲突.此方法对计算机网络结点访问/冲突避免的研究具有一定的参考价值.
|
| 关 键 词： | 概率矩阵 文法 基元 网络. |
| 收稿时间： | 1997-11-11 |
| 修稿时间： | 1998-02-11 |
Research of a Formal Language for Describingomputer Network Topology |
| |
| YU Zhi-shou and YANG Jing. Research of a Formal Language for Describingomputer Network Topology[J]. Journal of Software, 1999, 10(2): 210-215 |
| |
| Authors: | YU Zhi-shou and YANG Jing |
| |
| Affiliation: | Department of Computer Application Harbin University of Civil Engineering and Architecture Harbin 150008 |
| |
| Abstract: | Being different from the general method, a formal language and grammar, stochastic liner grammar and its representation are used to describe the topology logic of the computer network by analyzing the grammar of three elemental statuses. It can be seen that combining them may describe statuses of each node in communication and shared memory of the computer network. In this paper, it is proved that the grammar can establish only route between the start node and the terminal node in some conditions. Under conditions above if may avoid collision. The use and the limit of the grammar are presented at the end of the paper. |
| |
| Keywords: | Probability matrix grammar base element network. |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《软件学报》浏览原始摘要信息 |
|
点击此处可从《软件学报》下载全文 |
