A Polynomial Time Algorithm for Checking Regularity of Totally Normed Process Algebra |
| |
| Authors: | YANG Fei HUANG Hao |
| |
| Affiliation: | Laboratory of Basic Studies in Computing Science, Department of Computer Science and Engineering,Shanghai Jiaotong University, Shanghai 200240, China |
| |
| Abstract: | ![]()
A polynomial algorithm for the regularity problem of weak and branching bisimilarity on totally normed process algebra(PA) processes is given. Its time complexity is O(n3+ mn), where n is the number of transition rules and m is the maximal length of the rules. The algorithm works for totally normed basic process algebra(BPA) as well as basic parallel process(BPP). |
| |
| Keywords: | regularity checking totally normed process algebra (PA) weak bisimulation |
| 本文献已被 CNKI 等数据库收录！ |
|
