Abstract
An operational complexity model (OCM) is proposed to enable the complexity of both the cognitive and the computational components of a process to be determined. From the complexity of formation of a set of traces via a specified route a measure of the probability of that route can be determined. By determining the complexities of alternative routes leading to the formation of the same set of traces, the odds indicating the relative plausibility of the alternative routes can be found. An illustrative application to a BitTorrent piracy case is presented, and the results obtained suggest that the OCM is capable of providing a realistic estimate of the odds for two competing hypotheses. It is also demonstrated that the OCM can be straightforwardly refined to encompass a variety of circumstances.
| Original language | English |
|---|---|
| Title of host publication | Availability, Reliability, and Security, 2010. ARES '10 International Conference on Availability, Reliability and Security |
| Subtitle of host publication | Proceedings, the Fifth International Conference on Availability, Reliability and Security : Krakow, Poland, 15-18 February 2010 |
| Place of Publication | Los Alamitos, Calif |
| Publisher | IEEE Computer Society |
| Pages | 671 - 676 |
| Number of pages | 6 |
| ISBN (Print) | 9780769539652, 9781424458790 |
| DOIs | |
| Publication status | Published - Feb 2010 |
| Event | 5th International Conference on Availability, Reliability and Security - Cracow, Poland Duration: 15 Feb 2010 → 18 Feb 2010 |
Conference
| Conference | 5th International Conference on Availability, Reliability and Security |
|---|---|
| Country/Territory | Poland |
| City | Cracow |
| Period | 15/02/2010 → 18/02/2010 |