{'fraction_non_alphanumeric': 0.013761467889908258, 'fraction_numerical': 0.0, 'mean_word_length': 5.936507936507937, '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}}
Cross Cutting Condensed Graphs

Condensed Graphs provide a graph based programming model that unifies availability-driven, coerciondriven and control-driven computing. In this paper we explore the issues of concurrency and synchronisation between condensed graph applications. A paradigm for condensed graph synchronisation is proposed and an architectural pattern is developed that forms the basis of a novel synchronisation mechanism.