Trustworthy Systems

Rooted divergence-preserving branching bisimilarity is a congruence

Authors

Rob van Glabbeek, Bas Luttik and Linda Spaninks

DATA61

Eindhoven University of Technology

UNSW Sydney

Abstract

We prove that rooted divergence-preserving branching bisimilarity is a congruence for the process specification language consisting of nil, action prefix, choice, and the recursion construct.

BibTeX Entry

  @article{vanGlabbeek_LS_20,
    author           = {van Glabbeek, Robert and Luttik, Bas and Spaninks, Linda},
    date             = {2020-8-28},
    doi              = {https://doi.org/10.23638/LMCS-16(3:14)2020},
    issue            = {3},
    journal          = {Logical Methods in Computer Science},
    keywords         = {Process algebra; Recursion; Branching bisimulation; Divergence; Congruence.},
    month            = aug,
    pages            = {14:0-14;16},
    paperurl         = {https://trustworthy.systems/publications/full_text/vanGlabbeek_LS_20.pdf},
    publisher        = {Logical Methods in Computer Science},
    title            = {Rooted Divergence-Preserving Branching Bisimilarity is a Congruence},
    volume           = {16},
    year             = {2020}
  }

Download