𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Rooted Branching Bisimulation as a Congruence

✍ Scribed by Wan Fokkink

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
246 KB
Volume
60
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

Branching time and orthogonal bisimulati
Branching time and orthogonal bisimulation equivalence
✍ Jan A. Bergstra; Alban Ponse; Mark B. van der Zwaag πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 609 KB

We propose a reΓΏnement of branching bisimulation equivalence that we call orthogonal bisimulation equivalence. Typically, internal activity (the performance of -steps) may be compressed, but not completely discarded. Hence, a process with -steps cannot be equivalent to one without -steps. Also, we p