{"file":[{"success":1,"content_type":"application/pdf","relation":"main_file","file_name":"2024_LNCS_Bonakdarpour.pdf","date_updated":"2024-11-11T09:42:28Z","checksum":"7b8ca21b8c19ab796fa445b0e54003ca","file_id":"18539","date_created":"2024-11-11T09:42:28Z","file_size":1897101,"creator":"dernst","access_level":"open_access"}],"conference":{"start_date":"2024-10-15","end_date":"2024-10-17","name":"RV: Conference on Runtime Verification","location":"Istanbul, Turkey"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","OA_place":"publisher","article_processing_charge":"Yes (in subscription journal)","citation":{"ieee":"B. Bonakdarpour, A. Momtaz, D. Nickovic, and N. E. Sarac, “Approximate distributed monitoring under partial synchrony: Balancing speed & accuracy,” in 24th International Conference on Runtime Verification, Istanbul, Turkey, 2024, vol. 15191, pp. 282–301.","ama":"Bonakdarpour B, Momtaz A, Nickovic D, Sarac NE. Approximate distributed monitoring under partial synchrony: Balancing speed & accuracy. In: 24th International Conference on Runtime Verification. Vol 15191. Springer Nature; 2024:282-301. doi:10.1007/978-3-031-74234-7_18","ista":"Bonakdarpour B, Momtaz A, Nickovic D, Sarac NE. 2024. Approximate distributed monitoring under partial synchrony: Balancing speed & accuracy. 24th International Conference on Runtime Verification. RV: Conference on Runtime Verification, LNCS, vol. 15191, 282–301.","short":"B. Bonakdarpour, A. Momtaz, D. Nickovic, N.E. Sarac, in:, 24th International Conference on Runtime Verification, Springer Nature, 2024, pp. 282–301.","chicago":"Bonakdarpour, Borzoo, Anik Momtaz, Dejan Nickovic, and Naci E Sarac. “Approximate Distributed Monitoring under Partial Synchrony: Balancing Speed & Accuracy.” In 24th International Conference on Runtime Verification, 15191:282–301. Springer Nature, 2024. https://doi.org/10.1007/978-3-031-74234-7_18.","apa":"Bonakdarpour, B., Momtaz, A., Nickovic, D., & Sarac, N. E. (2024). Approximate distributed monitoring under partial synchrony: Balancing speed & accuracy. In 24th International Conference on Runtime Verification (Vol. 15191, pp. 282–301). Istanbul, Turkey: Springer Nature. https://doi.org/10.1007/978-3-031-74234-7_18","mla":"Bonakdarpour, Borzoo, et al. “Approximate Distributed Monitoring under Partial Synchrony: Balancing Speed & Accuracy.” 24th International Conference on Runtime Verification, vol. 15191, Springer Nature, 2024, pp. 282–301, doi:10.1007/978-3-031-74234-7_18."},"_id":"18521","scopus_import":"1","ec_funded":1,"date_updated":"2024-11-11T09:45:14Z","date_created":"2024-11-10T23:01:58Z","type":"conference","arxiv":1,"corr_author":"1","has_accepted_license":"1","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031742330"],"issn":["0302-9743"]},"author":[{"last_name":"Bonakdarpour","first_name":"Borzoo","full_name":"Bonakdarpour, Borzoo"},{"first_name":"Anik","full_name":"Momtaz, Anik","last_name":"Momtaz"},{"id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","last_name":"Nickovic","full_name":"Nickovic, Dejan","first_name":"Dejan"},{"last_name":"Sarac","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","first_name":"Naci E","full_name":"Sarac, Naci E"}],"page":"282-301","publication":"24th International Conference on Runtime Verification","project":[{"grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020"}],"publication_status":"published","language":[{"iso":"eng"}],"publisher":"Springer Nature","title":"Approximate distributed monitoring under partial synchrony: Balancing speed & accuracy","date_published":"2024-10-12T00:00:00Z","alternative_title":["LNCS"],"abstract":[{"text":"In distributed systems with processes that do not share a global clock, partial synchrony is achieved by clock synchronization that guarantees bounded clock skew among all applications. Existing solutions for distributed runtime verification under partial synchrony against temporal logic specifications are exact but suffer from significant computational overhead. In this paper, we propose an approximate distributed monitoring algorithm for Signal Temporal Logic (STL) that mitigates this issue by abstracting away potential interleaving behaviors. This conservative abstraction enables a significant speedup of the distributed monitors, albeit with a tradeoff in accuracy. We address this tradeoff with a methodology that combines our approximate monitor with its exact counterpart, resulting in enhanced efficiency without sacrificing precision. We evaluate our approach with multiple experiments, showcasing its efficacy in both real-world applications and synthetic examples.","lang":"eng"}],"intvolume":" 15191","quality_controlled":"1","day":"12","department":[{"_id":"ToHe"}],"status":"public","file_date_updated":"2024-11-11T09:42:28Z","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093. This work is sponsored in part by the United States NSF CCF-2118356 award. This research was partially funded by A-IQ Ready (Chips JU, grant agreement No. 101096658).","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"month":"10","OA_type":"hybrid","oa":1,"ddc":["000"],"doi":"10.1007/978-3-031-74234-7_18","volume":15191,"year":"2024","external_id":{"arxiv":["2408.05033"]}}