Rooted Divergence-Preserving Branching Bisimilarity is a Congruence: A Simpler Proof

Download PDF
Open Webpage

David N. Jansen, Xinxin Liu

Published: 01 Jan 2022, Last Modified: 06 Mar 2025A Journey from Process Algebra via Timed Automata to Model Learning 2022EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Van Glabbeek, Luttik and Spanink proved in 2020 [3] that rooted divergence-preserving branching bisimilarity is a congruence for the process specification language consisting of inaction, action prefix, choice, and recursion. In this article we show the same result by using an alternative characterization of bisimulation, so that the heavy notion of bisimulation up to can be spared and a shorter proof obtained.