Four Rules for Converting Complex Loops to Regular Expressions

Abstract

It is an effective means to ensure the reliability of critical systems by simulating all possible stats during system operation. In the past, researchers used state diagrams and automata to describe the operation of the system. However, because the system execution sequence directly generated by the state diagram and automata is often incomplete, some states in the system cannot be reached. Therefore, some researches have converted state diagrams or automata into regular expressions, and then generated system execution sequences from regular expressions. However, few researchers have focused on the construction of regular expressions for complex loops. The paper presents a new method for constructing regress expressions for complex loops. We introduce four types of loops and give rules for converting these loops to regular expressions. Our research helps to construct the regular expression model of software and obtain all possible running states of the software.