Rooted branching bisimulation as a congruence

Wan Fokkink*

*Corresponding author for this work

Research output: Contribution to JournalArticleAcademicpeer-review


This article presents a congruence format, in structural operational semantics, for rooted branching bisimulation equivalence. The format imposes additional requirements on Groote's ntyft format. It extends an earlier format by Bloom with standard notions such as recursion, iteration, predicates, and negative premises.

Original languageEnglish
Pages (from-to)13-37
Number of pages25
JournalJournal of Computer and System Sciences
Issue number1
Publication statusPublished - 1 Jan 2000


Dive into the research topics of 'Rooted branching bisimulation as a congruence'. Together they form a unique fingerprint.

Cite this