{'fraction_non_alphanumeric': 0.01903553299492386, 'fraction_numerical': 0.0, 'mean_word_length': 5.575, '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}}
Formalization of UML Statechart Models Using Concurrent Regular Expressions

The Unified Modeling Language (UML) is widely used in the software development process for specification of system based on the object-oriented paradigm. Thought the current version of UML is semi-formal, it is difficult to determine whether the model is consistent, unambiguous, or complete. This paper proposes the transformation rules for formalizing UML statechart diagrams. The target language for the transformation is Concurrent Regular Expressions (CREs) which are extensions of regular expression. The transformation result will be represented in mathematical form and suitable for applying verification. We also show that this formalization can be used to check the simple inconsistency of the system.