Complexity Measures for Concurrent Programs Based on Information-Theoretic Metrics
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.
- Publisher
- Elsevier Science Bv
- Issue Date
- 1993-04
- Language
- English
- Article Type
- Article
- Citation
INFORMATION PROCESSING LETTERS, v.46, no.1, pp.43 - 50
- ISSN
- 0020-0190
- Appears in Collection
- CS-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 4 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.