帶標識加權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. -
計量
- 文章訪問數: 1938
- HTML全文瀏覽量: 129
- PDF下載量: 338
- 被引次數: 0
下載:
