微信服务号

微信订阅号

2025年5月1日 11:16 星期四
首页 > 过刊浏览>2018年第29卷第6期 >1517-1526. DOI:10.13328/j.cnki.jos.005461
PDF HTML阅读 XML下载 导出引用 引用提醒
互模拟准局部验证算法的扩展与实现
作者:
作者简介:

郑晓琳(1993-),女,福建莆田人,硕士,主要研究领域为形式化方法;邓玉欣(1978-),男,博士,教授,博士生导师,CCF高级会员,主要研究领域为形式化方法,程序语义;付辰(1991-),男,学士,主要研究领域为模型检测;雷国庆(1990-),男,硕士,主要研究领域为形式化方法.

通讯作者:

邓玉欣,E-mail:yxdeng@sei.ecnu.edu.cn

基金项目:

国家自然科学基金（61672229，61261130589）；上海市自然科学基金（16ZR1409100）


Extension and Implementation of the Quasi-Local Algorithm for Checking Bisimilarity
Author:
Fund Project:

National Natural Science Foundation of China (61672229, 61261130589); Natural Science Foundation of Shanghai, China (16ZR1409100)

  • 摘要
    • | |
  • 访问统计
    • |
  • 参考文献 [19]
    • |
  • 相似文献 [20]
    • |
  • 引证文献
    • | |
  • 文章评论
    摘要:

    互模拟是并发系统分析和验证的一个重要概念.主要扩展了一种由Du和Deng提出的准局部算法，使其更加适用于一般的标记迁移系统.用Java实现扩展后的准局部算法与Fernandez和Mounier提出的局部算法.以VLTS为实验数据基准进行大量的实验，发现在大多数情况下，前者的性能比后者更好.同时，修改了算法使其能够验证模拟关系.最后，用Java实现对标记迁移系统进行转换，使算法同时可以验证弱互模拟关系.

    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.

    参考文献
    [1] Park D. Concurrency and automata on infinite sequences. In:Proc. of the GI-Conf. on Theoretical Computer Science. 1981. 167-183.[doi:10.1007/BFb0017309]
    [2] Milner R. Communication and Concurrency. Prentice-Hall, Inc., 1989.
    [3] Sangiorgi D. Introduction to Bisimulation and Coinduction. Cambridge University Press, 2011.
    [4] Dovier A, Piazza C, Policriti A. An efficient algorithm for computing bisimulation equivalence. Theoretical Computer Science, 2002,311(1-3):221-256.[doi:10.1016/S0304-3975(03)00361-X]
    [5] Fisler K, Vardi MY. Bisimulation minimization and symbolic model checking. Formal Methods in System Design, 2002,21(1):39-78.[doi:10.1023/A:1016091902809]
    [6] Fernandez JC, Mounier L. Verifying bisimulations on the fly. In:Proc. of the 3rd Int'l Conf. on Formal Description Techniques for Distributed Systems and Communication Protocols. North-Holland Publishing Co., 1990. 95-110.
    [7] Du WJ, Deng YX. A quasi-local algorithm for checking bisimilarity. In:Proc. of the IEEE Int'l Conf. on Computer Science and Automation Engineering. 2011. 1-5.[doi:10.1109/CSAE.2011.5952411]
    [8] The VLTS benchmark suite. http://cadp.inria.fr/resources/vlts/
    [9] Valmari A. Simple bisimilarity minimization in O(mlogn) time. Applications and Theory of Petri Nets, 2010,105(3):319-339.[doi:10.3233/FI-2010-369]
    [10] Garavel H, Lang F, Mateescu R, Serwe W. CADP 2011:A toolbox for the construction and analysis of distributed processes. Software Tools for Technology Transfer, 2013,15(2):89-107.[doi:10.1007/s10009-012-0244-z]
    [11] Groote JF, Wijs A. An O(mlogn) algorithm for stuttering equivalence and branching bisimulation. In:Proc. of the 22nd Int'l Conf. on Tools and Algorithms for the Construction and Analysis of Systems. LNCS 9636, Springer-Verlag, 2016. 607-624.[doi:10.1007/978-3-662-49674-9_40]
    [12] Wijs A. GPU accelerated strong and branching bisimilarity checking. In:Proc. of the 21st Int'l Conf. on Tools and Algorithms for the Construction and Analysis of Systems. LNCS 9035, Springer-Verlag, 2015. 368-383.[doi:10.1007/978-3-662-46681-0_29]
    [13] Dalsgaard AE, Enevoldsen S, Larsen KG, Srba J. Distributed computation of fixed points on dependency graphs. In:Proc. of the 2nd Int'l Symp. on Dependable Software Engineering:Theories, Tools, and Applications. LNCS 9984, Springer-Verlag, 2016. 197-212.[doi:10.1007/978-3-319-47677-3_13]
    [14] Kundu S, Lerner S, Gupta R. Validating high-level synthesis. In:Proc. of the 20th Int'l Conf. on Computer Aided Verification. LNCS 5123, Springer-Verlag, 2008. 459-472.[doi:10.1007/978-3-540-70545-1_44]
    [15] Hao KC, Ray S, Xie F. Equivalence checking for function pipelining in behavioral synthesis. In:Proc. of the DATE 2014. European Design and Automation Association, 2014. 1-6.[doi:10.7873/DATE.2014.163]
    [16] http://www.doc.ic.ac.uk/~jnm/LTSdocumention/AB_example.html
    [17] Wikipedia. https://en.wikipedia.org/wiki/Alternating_bit_protocol
    [18] Peralta JC, Gautier T, Besnard L, Guernic PL. LTS for Translation Validation of (multi-clocked) SIGNAL Specifications. IEEE, 2010.[doi:10.1109/MEMCOD.2010.5558632]
    [19] Fiacre. http://projects.laas.fr/fiacre/
    引证文献
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

郑晓琳,邓玉欣,付辰,雷国庆.互模拟准局部验证算法的扩展与实现.软件学报,2018,29(6):1517-1526

复制
分享
文章指标
  • 点击次数:3495
  • 下载次数: 6162
  • HTML阅读次数: 2988
  • 引用次数: 0
历史
  • 收稿日期:2017-06-28
  • 最后修改日期:2017-09-01
  • 录用日期:2017-11-06
  • 在线发布日期: 2017-12-28
文章二维码
友情链接:中国科学院软件研究所中国计算机学会中国科学院国家自然科学基金委员会CCF数字图书馆Int'l J of Softw Info计算机系统应用
您是第19893203位访问者
版权所有：中国科学院软件研究所 京ICP备05046678号-3
地址：北京市海淀区中关村南四街4号,邮政编码：100190
电话：010-62562563 传真：010-62562533 Email：jos@iscas.ac.cn
技术支持：北京勤云科技发展有限公司

京公网安备 11040202500063号