Is timed branching bisimilarity a congruence indeed?

Research output: Contribution to journalArticleAcademicpeer-review

4 Citations (Scopus)


We show that timed branching bisimilarity as defined by Van der Zwaag [17] and Baeten and Middelburg [2] is not an equivalence relation, in case of a dense time domain. We propose an adaptation based on Van der Zwaag's definition, and prove that the resulting timed branching bisimilarity is an equivalence indeed. Furthermore, we prove that in case of a discrete time domain, Van der Zwaag's definition and our adaptation coincide. Finally, we prove that a rooted version of timed branching bisimilarity is a congruence over a basic timed process algebra containing parallelism, successful termination and deadlock.
Original languageEnglish
Pages (from-to)287-311
JournalFundamenta Informaticae
Issue number3-4
Publication statusPublished - 2008


Dive into the research topics of 'Is timed branching bisimilarity a congruence indeed?'. Together they form a unique fingerprint.

Cite this