COMPLEXITY-MEASURES FOR CONCURRENT PROGRAMS BASED ON INFORMATION-THEORETIC METRICS

被引：5

作者：

CHA, S ^{[1
]}

CHUNG, IS ^{[1
]}

KWON, YR ^{[1
]}

机构：

[1] KOREA ADV INST SCI & TECHNOL, DEPT COMP SCI, 373-1 KUSONG DONG, YUSUNG GU, TAEJON 305701, SOUTH KOREA

来源：

INFORMATION PROCESSING LETTERS | 1993年 / 46卷 / 01期

关键词：

SOFTWARE METRIC; INFORMATION THEORY; CONCURRENT PROGRAM COMPLEXITY; EXCESS ENTROPY; COMPUTATIONAL COMPLEXITY; CONCURRENCY;

D O I：

10.1016/0020-0190(93)90195-F

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We present a model and information-theoretic measures (entropy) which provide the complexity of concurrent programs. The information content, risk ratio and the amount of intertasking activity contained in a concurrent program are measured in terms of the information in the corresponding graph representation.

引用

页码：43 / 50

页数：8

共 10 条

[1] A COMPARISON OF MEASURES OF CONTROL FLOW COMPLEXITY [J].