Rooted branching bisimulation as a congruence
type: Item
instance of: scholarly article
title: Rooted branching bisimulation as a congruence
zbMATH Open document ID: 0955.68074
published in: Journal of Computer and System Sciences
publication date: 2000-07-27T00:00:00Z
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 1441896
zbMATH Keywords: structural operational semantics
author: Wan Fokkink
MaRDI profile type: Publication
full work available at URL: jcss.1999.1663
OpenAlex ID: W2050078030
cites work: Q4727412
cites work: Term-rewriting systems with rule priorities
cites work: Q3761680
cites work: Process Algebra
cites work: Processes and the denotational semantics of concurrency
cites work: Branching bisimilarity is an equivalence indeed!
cites work: Structural operational semantics for weak bisimulations
cites work: Bisimulation can't be traced
cites work: The meaning of negative premises in transition system specifications
cites work: Language preorder as a precongruence
cites work: \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
cites work: A conservative look at operational semantics with variable binding
cites work: The well-founded semantics for general logic programs
cites work: Q3753475
cites work: Q4299862
cites work: Q4818861
cites work: Branching time and abstraction in bisimulation semantics
cites work: Transition system specifications with negative premises
cites work: Structured operational semantics and bisimulation as a congruence
cites work: Q3929062
cites work: Q3992568
cites work: Q3907077
cites work: Operational semantics of rewriting with priorities
cites work: Q3348437
cites work: Q3486858
cites work: A lattice-theoretical fixpoint theorem and its applications
cites work: Q4847024
cites work: The algebra of communicating processes with empty process
DOI: 10.1006/JCSS.1999.1663
description: scientific article; zbMATH DE number 1441896