Computing Maximal Bisimulations

  • Alexandre Boulgakov
  • Thomas Gibson-Robinson
  • A. W. Roscoe
Conference paper

DOI: 10.1007/978-3-319-11737-9_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8829)
Cite this paper as:
Boulgakov A., Gibson-Robinson T., Roscoe A.W. (2014) Computing Maximal Bisimulations. In: Merz S., Pang J. (eds) Formal Methods and Software Engineering. ICFEM 2014. Lecture Notes in Computer Science, vol 8829. Springer, Cham

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Alexandre Boulgakov
    • 1
  • Thomas Gibson-Robinson
    • 1
  • A. W. Roscoe
    • 1
  1. 1.Department of Computer ScienceUniversity of OxfordOxfordUK

Personalised recommendations