Abstract
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 language | English |
---|---|
Pages (from-to) | 13-37 |
Number of pages | 25 |
Journal | Journal of Computer and System Sciences |
Volume | 60 |
Issue number | 1 |
DOIs | |
Publication status | Published - 1 Jan 2000 |
Funding
1Supported by a grant from The Nuffield Foundation.