Computing maximal weak and other bisimulations |
| |
Authors: | Alexandre Boulgakov Thomas Gibson-Robinson A. W. Roscoe |
| |
Affiliation: | 1.Department of Computer Science,University of Oxford,Oxford,UK |
| |
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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|