{'fraction_non_alphanumeric': 0.00904392764857881, 'fraction_numerical': 0.0, 'mean_word_length': 5.458333333333333, '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}}
Formal modeling for consistency checking of signal transition graph

The behavior of asynchronous hardware system is crucial and practically assured using the formal verification techniques. A signal transition graph is one of the effective alternatives to represent the behavioral design of a huge asynchronous system. The design could be verified beforehand to assure several essential properties including its consistency property. In this paper, the formal modeling scheme of a signal transition graph is proposed along with the consistency property in term of the linear temporal formula. The target signal transition graph is written in Promela code and verified using SPIN model checker. The result shows that the method can verify consistency property automatically.