Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

JCSS
2000

favoriteEmaildiscussreport

98views more JCSS 2000»

Rooted Branching Bisimulation as a Congruence

13 years 4 months ago

Rooted Branching Bisimulation as a Congruence

Download www.cs.vu.nl

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.

Wan Fokkink

Real-time Traffic

Bisimulation Equivalence | Congruence Format | JCSS 2000 | Structural Operational Semantics |

claim paper

Related Content

» Divide and Congruence From Decomposition of Modalities to Preservation of Branching Bisimu...

» Branching Bisimulation Congruence for Probabilistic Systems

» A Characterisation of Weak Bisimulation Congruence

» Is Timed Branching Bisimilarity a Congruence Indeed

» A ContextFree Process as a Pushdown Automaton

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2000
Where	JCSS
Authors	Wan Fokkink

Comments (0)