{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:12:41Z","timestamp":1781104361980,"version":"3.54.1"},"reference-count":27,"publisher":"IGI Global Scientific Publishing","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,7]]},"abstract":"<jats:p>Developing correct dependable distributed applications is a difficult task. The techniques developed to detect distributed predicates can be used to verify the satisfaction of specific properties (represented as predicates) in a given run of a distributed application. These techniques have several applications including the verification of the correctness of a particular implementation of a distributed system (runtime verification). Due to concurrency, the number of states to be considered in detecting a distributed predicate is exponential. This article investigates the effectiveness of using a meta-heuristic algorithm in solving the problem of detecting distributed predicates. Namely, the authors have used the Artificial Bee Colony algorithm to develop an algorithm to detect distributed predicates. The conducted experiments demonstrate that the ABC-based detection algorithm has a better performance compared with the traditional state enumeration-based detection algorithm.<\/jats:p>","DOI":"10.4018\/ijdst.2018070104","type":"journal-article","created":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T11:32:48Z","timestamp":1528716768000},"page":"53-64","source":"Crossref","is-referenced-by-count":2,"title":["An Artificial Bee Colony Algorithm for Detecting Distributed Predicates"],"prefix":"10.4018","volume":"9","author":[{"given":"Eslam","family":"Al Maghayreh","sequence":"first","affiliation":[{"name":"King Saud University, Riyadh, Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"IJDST.2018070104-0","author":"E.Al Maghayreh","year":"2010","journal-title":"Simplifying Runtime Verification of Distributed Programs: Ameliorating the State Space Explosion Problem"},{"key":"IJDST.2018070104-1","doi-asserted-by":"publisher","DOI":"10.1109\/CCECE.2011.6030585"},{"key":"IJDST.2018070104-2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90005-3"},{"key":"IJDST.2018070104-3","doi-asserted-by":"publisher","DOI":"10.1145\/214451.214456"},{"key":"IJDST.2018070104-4","unstructured":"Chang, Y., & Garg, V. K. (2016). Predicate detection for parallel computations with locking constraints. In 20th International Conference on Principles of Distributed Systems, OPODIS (pp. 17:1-17:17)."},{"key":"IJDST.2018070104-5","doi-asserted-by":"publisher","DOI":"10.1109\/SRDS.2013.19"},{"key":"IJDST.2018070104-6","doi-asserted-by":"publisher","DOI":"10.1145\/127695.122774"},{"key":"IJDST.2018070104-7","doi-asserted-by":"publisher","DOI":"10.1109\/71.995818"},{"key":"IJDST.2018070104-8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76627-8_23"},{"key":"IJDST.2018070104-9","author":"V. K.Garg","year":"2002","journal-title":"Elements of distributed computing"},{"key":"IJDST.2018070104-10","doi-asserted-by":"publisher","DOI":"10.1109\/71.277788"},{"key":"IJDST.2018070104-11","doi-asserted-by":"publisher","DOI":"10.1109\/71.553309"},{"key":"IJDST.2018070104-12","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2009.03.090"},{"key":"IJDST.2018070104-13","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2007.05.007"},{"key":"IJDST.2018070104-14","doi-asserted-by":"publisher","DOI":"10.1109\/SIU.2017.7960626"},{"key":"IJDST.2018070104-15","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359563"},{"key":"IJDST.2018070104-16","doi-asserted-by":"publisher","DOI":"10.1109\/PDCAT.2007.56"},{"key":"IJDST.2018070104-17","doi-asserted-by":"publisher","DOI":"10.1109\/DASC.2007.24"},{"key":"IJDST.2018070104-18","first-page":"215","article-title":"Virtual Time and Global States of Distributed Systems.","author":"F.Mattern","year":"1989","journal-title":"Proceedings of the International Workshop on Parallel and Distributed Algorithms"},{"key":"IJDST.2018070104-19","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.12.037"},{"key":"IJDST.2018070104-20","doi-asserted-by":"publisher","DOI":"10.1109\/SIU.2017.7960422"},{"key":"IJDST.2018070104-21","doi-asserted-by":"publisher","DOI":"10.1109\/ELECTRONICS.2017.7995218"},{"key":"IJDST.2018070104-22","doi-asserted-by":"publisher","DOI":"10.1109\/SCOPES.2016.7955520"},{"key":"IJDST.2018070104-23","unstructured":"Spezialetti, M., & Kearns, P. (1986). Efficient distributed snapshots. In ICDCS (pp. 382-388)."},{"key":"IJDST.2018070104-24","doi-asserted-by":"publisher","DOI":"10.1109\/JSTARS.2015.2454518"},{"key":"IJDST.2018070104-25","doi-asserted-by":"publisher","DOI":"10.1145\/3007748.3007780"},{"key":"IJDST.2018070104-26","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2409839"}],"container-title":["International Journal of Distributed Systems and Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=207692","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,5]],"date-time":"2022-05-05T20:10:41Z","timestamp":1651781441000},"score":1,"resource":{"primary":{"URL":"http:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJDST.2018070104"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":27,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.4018\/ijdst.2018070104","relation":{},"ISSN":["1947-3532","1947-3540"],"issn-type":[{"value":"1947-3532","type":"print"},{"value":"1947-3540","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7]]}}}