Rooted branching bisimulation as a congruence

Research output: Contribution to JournalArticleAcademicpeer-review

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 languageEnglish
Pages (from-to)13-37
Number of pages25
JournalJournal of Computer and System Sciences
Volume60
Issue number1
DOIs
Publication statusPublished - 1 Jan 2000

Fingerprint

Structural Operational Semantics
Bisimulation
Recursion
Predicate
Congruence
Branching
Semantics
Equivalence
Iteration
Requirements
Standards

Cite this

@article{0ae685b94dff4855816a5250ffe7291f,
title = "Rooted branching bisimulation as a congruence",
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.",
author = "Wan Fokkink",
year = "2000",
month = "1",
day = "1",
doi = "10.1006/jcss.1999.1663",
language = "English",
volume = "60",
pages = "13--37",
journal = "Journal of Computer and System Sciences",
issn = "0022-0000",
publisher = "Elsevier",
number = "1",

}

Rooted branching bisimulation as a congruence. / Fokkink, Wan.

In: Journal of Computer and System Sciences, Vol. 60, No. 1, 01.01.2000, p. 13-37.

Research output: Contribution to JournalArticleAcademicpeer-review

TY - JOUR

T1 - Rooted branching bisimulation as a congruence

AU - Fokkink, Wan

PY - 2000/1/1

Y1 - 2000/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0034140160&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034140160&partnerID=8YFLogxK

U2 - 10.1006/jcss.1999.1663

DO - 10.1006/jcss.1999.1663

M3 - Article

VL - 60

SP - 13

EP - 37

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

SN - 0022-0000

IS - 1

ER -