DC Field | Value | Language |
---|---|---|
dc.contributor.author | s. cha | ko |
dc.contributor.author | i. s. chung | ko |
dc.contributor.author | Kwon, Yong Rae | ko |
dc.date.accessioned | 2013-02-25T02:15:02Z | - |
dc.date.available | 2013-02-25T02:15:02Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1993-04 | - |
dc.identifier.citation | INFORMATION PROCESSING LETTERS, v.46, no.1, pp.43 - 50 | - |
dc.identifier.issn | 0020-0190 | - |
dc.identifier.uri | http://hdl.handle.net/10203/59034 | - |
dc.description.abstract | 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. | - |
dc.language | English | - |
dc.publisher | Elsevier Science Bv | - |
dc.title | Complexity Measures for Concurrent Programs Based on Information-Theoretic Metrics | - |
dc.type | Article | - |
dc.identifier.wosid | A1993LA61800009 | - |
dc.identifier.scopusid | 2-s2.0-0012168832 | - |
dc.type.rims | ART | - |
dc.citation.volume | 46 | - |
dc.citation.issue | 1 | - |
dc.citation.beginningpage | 43 | - |
dc.citation.endingpage | 50 | - |
dc.citation.publicationname | INFORMATION PROCESSING LETTERS | - |
dc.contributor.localauthor | Kwon, Yong Rae | - |
dc.contributor.nonIdAuthor | s. cha | - |
dc.contributor.nonIdAuthor | i. s. chung | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | SOFTWARE METRIC | - |
dc.subject.keywordAuthor | INFORMATION THEORY | - |
dc.subject.keywordAuthor | CONCURRENT PROGRAM COMPLEXITY | - |
dc.subject.keywordAuthor | EXCESS ENTROPY | - |
dc.subject.keywordAuthor | COMPUTATIONAL COMPLEXITY | - |
dc.subject.keywordAuthor | CONCURRENCY | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.