Rooted branching bisimulation as a congruence

DOI10.1006/jcss.1999.1663zbMath0955.68074OpenAlexW2050078030MaRDI QIDQ1975965

W. J. Fokkink

Publication date: 27 July 2000

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1999.1663

zbMATH Keywords

structural operational semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items

Rule formats for compositional non-interference properties, Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation, Operational semantics for Petri net components, A general SOS theory for the specification of probabilistic transition systems, SOS formats and meta-theory: 20 years after, Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity, Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity, Back to the format: a survey on SOS for probabilistic processes, Unnamed Item, Some undecidable properties of SOS specifications, Probabilistic divide \& congruence: branching bisimilarity, On cool congruence formats for weak bisimulations, Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes, A precongruence format for should testing preorder, Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence, Divide and congruence III: Stability & divergence, Raiders of the lost equivalence: probabilistic branching bisimilarity, Unnamed Item, Ordered SOS process languages for branching and eager bisimulations, Notes on Generative Probabilistic Bisimulation

Cites Work

• Structural operational semantics for weak bisimulations
• Transition system specifications with negative premises
• Structured operational semantics and bisimulation as a congruence
• Term-rewriting systems with rule priorities
• A conservative look at operational semantics with variable binding
• Operational semantics of rewriting with priorities
• Branching bisimilarity is an equivalence indeed!
• The algebra of communicating processes with empty process
• Language preorder as a precongruence
• \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
• A lattice-theoretical fixpoint theorem and its applications
• Process Algebra
• The well-founded semantics for general logic programs
• Bisimulation can't be traced
• Branching time and abstraction in bisimulation semantics
• The meaning of negative premises in transition system specifications
• Processes and the denotational semantics of concurrency
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item