{'fraction_non_alphanumeric': 0.012775842044134728, 'fraction_numerical': 0.003484320557491289, 'mean_word_length': 5.385185185185185, '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}}
Open Predicate Path Expressions and their Implementation in Highly Parallel Computing Environments

This document describes part of a concurrency control model to be added to the ANSA computational model and DPL. The concurrency control model can be used in non-atomic computations or for the ordering phase of atomic computations as described in AR.004. The concurrency control model is based upon path expressions. This document includes a description of the requirements for concurrency control, a survey of the various forms of path expression, a proposal for the elements of a concurrency control model, a syntax for that model and an implementation strategy with examples taken from a prototype implementation. Various options have been identified, pursuing some of these requires considerable additional work. Using Path Expressions as Concurrency Guards