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(n 3 +mn) 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).
| Original language | English |
|---|---|
| Pages (from-to) | 273-280 |
| Journal | Journal of Shanghai Jiaotong University (Science) |
| Volume | 20 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 1 Jun 2015 |
Fingerprint
Dive into the research topics of 'A polynomial time algorithm for checking regularity of totally normed process algebra'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver