Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.
Digital Object Identifier (DOI) : 10.14569/IJACSA.2012.031025
Article Published in International Journal of Advanced Computer Science and Applications(IJACSA), Volume 3 Issue 10, 2012.
Abstract: Detection of distributed predicates (also referred to as runtime verification) can be used to verify that a particular run of a given distributed program satisfies certain properties (represented as predicates). Consequently, distributed predicates detection techniques can be used to effectively improve the dependability of a given distributed application. Due to concurrency, the detection of distributed predicates can incur significant overhead. Most of the effective techniques developed to solve this problem work efficiently for certain classes of predicates, like conjunctive predicates. In this paper, we have presented a technique based on harmony search to efficiently detect the satisfaction of a predicate under the possibly modality. We have implemented the proposed technique and we have conducted several experiments to demonstrate its effectiveness.
Eslam Al Maghayreh, “A Harmony Search Based Algorithm for Detecting Distributed Predicates” International Journal of Advanced Computer Science and Applications(IJACSA), 3(10), 2012. http://dx.doi.org/10.14569/IJACSA.2012.031025