{'fraction_non_alphanumeric': 0.016293279022403257, 'fraction_numerical': 0.0, 'mean_word_length': 5.0, '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}}
Representation of logic functions by if-then clauses

In this short paper, an alternative representation of logic functions is proposed. Instead of using Boolean expressions to represent logic functions, a set of if-then clauses is used. It is shown how a Boolean expression can be translated to the equivalent form in general. This representation of logic functions speeds up the logic simulation and solves the deadlock problem in logic simulation using concurrent processes such as OCCAM.