| 摘要: |
| 互模拟是并发系统分析和验证的一个重要概念.主要扩展了一种由Du和Deng提出的准局部算法，使其更加适用于一般的标记迁移系统.用Java实现扩展后的准局部算法与Fernandez和Mounier提出的局部算法.以VLTS为实验数据基准进行大量的实验，发现在大多数情况下，前者的性能比后者更好.同时，修改了算法使其能够验证模拟关系.最后，用Java实现对标记迁移系统进行转换，使算法同时可以验证弱互模拟关系. |
| 关键词: 互模拟 标记迁移系统 扩展 |
| DOI：10.13328/j.cnki.jos.005461 |
| 分类号: |
| 基金项目:国家自然科学基金（61672229，61261130589）；上海市自然科学基金（16ZR1409100） |
|
| Extension and Implementation of the Quasi-Local Algorithm for Checking Bisimilarity |
|
ZHENG Xiao-Lin1, DENG Yu-Xin1, FU Chen2, LEI Guo-Qing1
|
|
1.Shanghai Key Laboratory of Trustworthy Computing(East China Normal University), Shanghai 200062, China;2.State Key Laboratory of Computer Science(Institute of Software, The Chinese Academy of Sciences), Beijing 100190, China
|
| Abstract: |
| Bisimilarity plays an important role in the analysis and verification of concurrent systems. In this paper, an optimization of the quasi-local algorithm of Du and Deng is proposed to make it applicable for general labeled transition systems. Both the optimized algorithm and the local algorithm of Fernandez and Mounier are implemented in Java, and experiment using the VLTS benchmark suite shows the former outperforms the latter in most cases. The algorithms are also modified to check similarity. Finally, a procedure for transforming labeled transition systems is implemented to facilitate checking weak bisimilarity. |
| Key words: bisimulation labeled transition system optimization weak bisimulation |
