标识T-网中同步距离的计算  

Computation of Synchronic Distance in Marked T-net

作　　者：王丽丽[1] 吴哲辉[2] 方欢[1] 

机构地区：[1]安徽理工大学理学院,淮南232001 [2]山东科技大学信息科学与工程学院,青岛266510

出　　处：《计算机科学》2008年第10期100-103,169,共5页Computer Science

基　　金：国家自然科学基金(60673053,60603090)

摘　　要：同步距离是刻画事件之间同步关系的一个重要的定量分析手段。由于同步距离的求解不仅和网的结构特征有关系,而且和网的初始标识也存在关系,因此到目前为止还没有一个很简洁易行的算法来求解一般Petri网的同步距离。然而,一些特殊的Petri网子类,如标识T-图、标识S-图的同步距离的计算已经有了较简洁的求解方法。对另一个Petri网子类——标识T-网给出了其同步距离的计算方法。标识T-网也可以直接通过网的结构和初始标识分布情况来得到变迁之间的同步距离,不需要考察网系统的运行,这就使得同步距离的求解简单易行。文中给出了相应的求解定理。Synchronic distance is an important analyzing metric to describe the dependence relationship between two events. Because computation of synchronic distance involves both structure and initial marking of net systems, a simple and feasible algorithm which can get synchronic distance in normal Petri nets doesn＇t have been obtained so far. Howew er computation of synchronic distance in some particular subclass of Petri nets such as marked T-graph and marked S- graph is simple and feasible. Another subclass of Petri net-marked T-net in which solution of synchronic distance is given in this paper. Synchronic distance of marked T-net can be directly obtained according to structure of net systems and distributed situation of initial marking, which make solution of synchronic distance become feasible. Solution theorem of them are given simultaneously in this paper.

关 键 词：同步距离 标识T-网 源库所 控制库所 控制库所接入变迁 

分 类 号：TP301[自动化与计算机技术—计算机系统结构] TS43[自动化与计算机技术—计算机科学与技术]