带标识加权T-图的化简
REDUCTION OPERATION ON MARKED T-GRAPH WITH WEIGHTS
-
摘要: 文中首先给出带标识加权T-图的几种化简运算，然后证明在一定条件下，这几种运算能保持网的活性不变，从而为带标识加权T-图的分析和综合提供了有效途径。
-
关键词:
- 化简运算;活性;带标识加权T-图
Abstract: Firstly, some reduction operations of marked T-graph with weights are given in this paper. Then the conditions for preserving liveness of marked T-graph with weights after these operations are discussed. These conclusions have important significance in analysis and synthesis of marked T-graph with weights. -
Murata T. Synthesis of decision-free concurrent systems for prescribed resources and preformance.[2]IEEE Trans. on Software Engineering, 1980, SE-6(6): 525-530.[3]Murata T, Koh J Y. Reduction and expansion of live and safe marked graphs. IEEE Trans. on Circuits and Syst, 1980, CAS-27(1): 68-70.[4]Baugh R J, Murata T. Additional methods for reduction and expansion of marked graphs. IEEE Trans. on Circuits and Syst, 1981, CAS-28(10): 1009-1014.[5]蒋昌俊加权T-图的几种化简运算.通信学报,1994, 15(2): 97-102.[6]许安国,吴哲辉.加权T-图的保性变换.计算机学报,1997, 20(11): 1038-1043.[7]许安国,王培良.加权T-图活性的进一步研究.计算机学报,1998, 21(1): 92-96.[8]Teruel E, Chrzastowski-Wachted P, Colom J M, Silva M. On weighted T-systems. Research Report CISI-RR-92-04, Dpto. Ing. Electrica a Informatica, Universidad de Zaragoza, 1992,[9]January. -
计量
- 文章访问数: 1907
- HTML全文浏览量: 120
- PDF下载量: 335
- 被引次数: 0
下载:
