{'fraction_non_alphanumeric': 0.02328159645232816, 'fraction_numerical': 0.0, 'mean_word_length': 5.184931506849315, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Temporal Logic over Partial Orders for Analysis of Real-Time Properties of Distributed Programs

Temporal logic is widely acclaimed to be a highly successful tool for analyzing non-real-time properties of programs. However, a few fundamental problems arise while designing temporal logic-based-techniques to verify real-time properties of programs. in this context, we formulate a modal logic called distribued logic (DL) by using ideas from both the interleaving and partial ordering approach. This logic uses spatial modal operators in addition to temporal operators for representing real-timed concurrency. In addition to the syntax and semantics of the logic, programming model and a formal proof technique based on the logic are also presented. Finally, use of the proof method is illustrated through the analysis of the real-time properties of a generic multiproceess producer/consumer program.