{'fraction_non_alphanumeric': 0.02490170380078637, 'fraction_numerical': 0.0, 'mean_word_length': 4.922480620155039, '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}}
Combining Paraconsistency and Probability in CTL

Computation tree logic (CTL) is known to be one of the most useful temporal logics for verifying concurrent 
 
systems by model checking technologies. However, CTL is not sufficient for handling inconsistency-tolerant 
 
and probabilistic accounts of concurrent systems. In this paper, a paraconsistent (or inconsistency-tolerant) 
 
probabilistic computation tree logic (PpCTL) is derived from an existing probabilistic computation tree logic 
 
(pCTL) by adding a paraconsistent negation connective. A theorem for embedding PpCTL into pCTL is 
 
proven, which indicates that we can reuse existing pCTL-based model checking algorithms. Some illustrative 
 
examples involving the use of PpCTL are also presented.