可达图 meaning in Chinese
reachability graph
reachabilitygraph
Examples
- For quantitative solution , we study gspn and find that the reachability graph of a gspn is isomorphic to a continuous time markov process ( ctmp ) when the vanishing markings are eliminated , so markov process method can be used
在安全性定量分析方面，我们研究发现去除消失标识后， gspn的可达图与一个连续时间markov过程( ctmp )是同构的，为此，可利用markov过程方法进行分析。 - Then the methods using reachability graph to analyze static and dynamic structural performance of colored timed workflow net are improved , and the theorem verifying whether there are deadlocks or traps in concurrent workflow are put forward using reachability graph
通过可达图分析着色时间工作流网静态和动态性能,提出用可达图检验工作流中是否存在死锁和陷阱的判断定理。 - Last , the temporal constraints are verified by alur ’ s model checking algorithm . this paper also verify the correctness of the data flow of the workflow . the data flow objects are added into the uml statecharts , and the semantic of data flow is
验证数据流正确性的过程中,在uml状态图中加入了数据流对象,定义了uml状态图的数据流语义,根据该语义给出了从uml状态图到全局状态可达图的转化算法,提出了验证数据流正确性的算法。 - This method not only specifies the structure and dynamic properties but also evaluates the performance of cryptographic protocol ( mainly time delay and software complexity ) . ( 3 ) firing rules of timed petri nets and the definition and algorithm of timed reachable graph are given
( 3 )给出了时延petri网的引发规则、时间可达图定义和构造算法，并且介绍了时延petri网的两个基本分析方法：时间可达图(或可覆盖图)和状态方程。