Computing maximal weak and other bisimulations-Reference-Cited by-同舟云学术

Computing maximal weak and other bisimulations

Published:2016-05 Issue:3 Volume:28 Page:381-407
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Boulgakov Alexandre¹,Gibson-Robinson Thomas¹,Roscoe A. W.¹

Affiliation:

1. Department of Computer Science, University of Oxford, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK

Abstract

Abstract We present and compare several algorithms for computing the maximal strong bisimulation, the maximal divergence-respecting delay bisimulation, and the maximal divergence-respecting weak bisimulation of a generalised labelled transition system. These bisimulation relations preserve CSP semantics, as well as the operational semantics of programs in other languages with operational semantics described by such GLTSs and relying only on observational equivalence. They can therefore be used to combat the space explosion problem faced in explicit model checking for such languages. We concentrate on algorithms which work efficiently when implemented rather than on ones which have low asymptotic growth.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s00165-016-0366-2.pdf

Reference27 articles.

1. Armstrong P Goldsmith M Lowe G Ouaknine J Palikareva H Roscoe AW Worrell J (2012) Recent developments in FDR. In: Computer aided verification. Springer pp 699–704

2. Boulgakov A Gibson-Robinson T Roscoe AW (2014) Computing maximal bisimulations. In: Formal methods and software engineering. Springer pp 11–26

3. A Distributed Algorithm for Strong Bisimulation Reduction of State Spaces

4. Distributed state space minimization

5. Blom S van de Pol J (2009) Distributed branching bisimulation minimization by inductive signatures. arXiv preprint arXiv:0912.2550

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Equivalence Checking 40 Years After: A Review of Bisimulation Tools;Lecture Notes in Computer Science;2022

2. Compositional Verification of Finite Automata under Event Preemption;2021 60th IEEE Conference on Decision and Control (CDC);2021-12-14

3. CORRECT AND EFFICIENT ANTICHAIN ALGORITHMS FOR REFINEMENT CHECKING;LOG METH COMPUT SCI;2021

4. Computing Coupled Similarity;Tools and Algorithms for the Construction and Analysis of Systems;2019

5. Circus2CSP: A Tool for Model-Checking Circus Using FDR;Lecture Notes in Computer Science;2019