{'fraction_non_alphanumeric': 0.02912621359223301, 'fraction_numerical': 0.0, 'mean_word_length': 5.346153846153846, '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}}
On recursive operations over logic LTS †

Recently, in order to mix algebraic and logic styles of specification in a uniform framework, the notion of a logic labelled transition system (Logic LTS or LLTS for short) has been introduced and explored. A variety of constructors over LLTS, including usual process-algebraic operators, logic connectives (conjunction and disjunction) and standard temporal modalities (always and unless), have been given. However, no attempt has been made so far to develop the general theory concerning (nested) recursive operations over LLTS and a few fundamental problems are still open. This paper intends to study this issue in a pure process-algebraic style. A few fundamental properties, including precongruence and the uniqueness of consistent solutions of equations, will be established.