By means of a comparative study, the author decided to use reachability matrix technique for identification.
对化工流程的拓扑分析，提出了一种改进算法，并用ALGOL 60语言编写了程序。
I have written for reachability matrix, the level of classified code.
详细说明：自己编写的求可达矩阵，层次划分代码。
With the friendly GUI of this tool, users can construct, delete, modify and save Petri nets easily. On the basis of incidence matrix of Petri nets, S-invariant and T-invariant can be generated by elementary linear transitions. And On the basis of reachability tree of Petri nets, boundedness, liveness and deadlock can be analysized.
本系统作为一个计算机辅助设计和分析工具，使用户可通过工具的图形用户界面进行Petri网的建立、删除、修改和存储，可通过对关联矩阵的初等线性变换求解Petri网的S-不变量和T-不变量，并可通过构造可达树对Petri网的有界性、活性和死锁等性能指标做出分析。
This is a division of reachability matrix procedures, reachability matrix of differentiation is a very important system engineering algorithms.
详细说明：这是一个可达性矩阵划分的程序，可达性矩阵划分是系统工程一个很重要的算法。
Firstly, for aim of static evolution of SA, SA relation matrix and reachability matrix are created.
在描述SA的构件-连接件模型的基础上，首先针对SA的静态演化，建立了SA邻接矩阵和可达矩阵，凭借矩阵变换与运算对SA静态演化中的波及效应进行了深入地分析和量化界定，同时给出了构件在SA中贡献大小相对量的计算方法。
Howerer, the traditional algorithm of Reachability Matrix is comparative complicated, especially when there are more nodes in the Directed Graph, the arithmetic amounts are big and not enough simple.
而可达矩阵的传统求法比较复杂，尤其是有向连接图中节点较多的时候，运算量大，不够简便。
During creating the interpretative structural modeling, for the part of figure, there is a kind of important matrix when showing the figure with matrix, that is Reachability Matrix. In modern systems engineering, Reachability Matrix is an important means to study the relation between the Directed Graph nodes.
在建立解释结构模型的过程中，对于图论部分，用矩阵表示图时涉及到一类重要的矩阵——可达矩阵，在现代系统工程中，可达矩阵是研究有向连接图节点关系的一种重要手段。
We define white graph and white condensation for nonautonomous and nonlinear DEDS, obtain two necessary and sufficient conditions of reachability and observability, and canonical structure for the system, also give their matrix descriptions.
对于非自治非线性DEDS，定义了白色图和凝白色图，得到了系统能达和能观的充要条件，以及系统的标准结构，并给出了它们的矩阵描述。
An ontology graph model, which creates ontology adjacency matrix and ontology reachability matrix, is described. Depending on matrix shift and calculation, ripple-effect of ontology evolution can be analyzed and its quantity can be ascertained.
本文提出了一种本体图模型，建立了本体邻接矩阵和可达矩阵，凭借矩阵变换与运算对本体演化中的波及效应进行了深入的分析和量化界定；
An improved algorithm for process topology analysis has been proposed and programmed in ALGOL 60. By means of a comparative study, the author decided to use reachability matrix technique for identification.
对化工流程的拓扑分析，提出了一种改进算法，并用ALGOL60语言编写了程序。注重对学生创新能力的培养。创新能力因子；
Petri net is a kind of good tool to describe concurrent and asynchronous system, there are many methods to analyze Petri net, such as reachability graph, reachability tree, incidence matrix and so on. However, its correctness can be proved by mathematics method.
Petri网是一个描述异步并发的图形工具，具有可达树、可达图、关联矩阵等多种分析方法，并且可以通过数学方法来证明其正确性；
The reachability matrix of directed graph plays a very important role on identifying whether a directed graph to be strongly connected or not and calculating the strongly connected sub graph.
图的可达性矩阵在判断图的强连通性以及求强连通分图中具有重要作用。
A simple and direct algorithm for computing reachability matrix of directed graph is introduced and proved.
介绍了采用邻接矩阵作关系矩阵解有向图的可达矩阵的一种简捷算法&轮流做媒法。
Reachability matrix of directed graph and calculation based on matrix calculation
基于布尔矩阵运算的有向图可达矩阵
A way of fuzzy cluster is provided, which is combined with reachability matrix and the idea of region partition in graph theory, in order to find out the number of the hidden layer nodes of RBF neural network.
本文提出一种同图论中可达矩阵和区域划分思想相结合的模糊聚类方法，以此来确定RBF网络的隐含层节点数。
Reachability matrix is an effective tool for identifying whether a directed graph to be strongly or weakly connected graph, it provides the calculating method of reachable matrix with the property of the Boolean matrix operation, the calculation method is easy and simple.
可达矩阵是判别一个有向图是否为强连通图或弱连通图的有效工具.利用布尔矩阵的运算性质给出了计算有向图可达矩阵的方法，该方法计算简便。
Moreover, introduce the idea of reachability matrix, by which, figure out the average transfer times and come out the arithmetic.
引入了可达矩阵的概念，利用可达矩阵计算出了公交线网的平均换乘次数，并给出了算法。
New Formula of Reachability Matrix
可达矩阵的新求法
Ripple-Effect Analysis of Software Architecture Evolution Based on Reachability Matrix
基于可达矩阵的软件体系结构演化波及效应分析
Discuss the Way of Reachability Matrix
关于可达矩阵的求法探讨