Process algebra based analysis and verification for asynchronous communications appeared in parallel programs

点击翻译按钮获取中文摘要

In this year, we investigated Knuth-Morris-Pratt type algorithms for regular expression pattern matching problems (called RPM) and for characterize its position and length.These investigations were derived from our research at the previous years, in which we study parallel programs base on coordination language and tuple space. In this situation, tuple space is modeled by fineite stae machine(FSM) and trace of process is modeled by string or sequence of actions that are primitive operations in coordination language. And we treat some problems in the field of model checking as acceptance problems for FSM or equivalently RPM.To treat RPM, we adopt regular expression function based on left quotient for strings instead of finite automata approach in order to avoid the "explosion problems for state space" in state based modeling of parallel processes. As a result we constructed algorithms based on regular expression function for solving RPM and for finding the position and length of it in some case of regular expressions.We presented these results at "Ouyou-suugaku Goudou Kenkyu Syukai" and "The 67^<th> National Convention of IPSJ".