On cool congruence formats for weak bisimulations

DOI10.1016/J.TCS.2011.02.036zbMATH Open1216.68199OpenAlexW2104917880MaRDI QIDQ549196FDOQ549196

Authors: Rob van Glabbeek 

Publication date: 7 July 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.02.036

Recommendations

• Theoretical Aspects of Computing – ICTAC 2005
• Processes, Terms and Cycles: Steps on the Road to Infinity
• CONCUR 2005 – Concurrency Theory
• Weak bisimulation as a congruence in MSOS
• Towards weak bisimulation for coalgebras
• A note on the characterization of weak bisimulation congruence in CCS
• From bialgebraic semantics to congruence formats
• Weak Bisimulation Approximants
• New up-to techniques for weak bisimulation
• Computing maximal weak and other bisimulations

zbMATH Keywords

CSPconcurrencyweak bisimulationstructural operational semanticsCCSbranching bisimulationdelay bisimulation\(\eta \)-bisimulation

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Higher-level synchronising devices in Meije-SCCS
• A structural approach to operational semantics
• Bisimulation can't be traced
• Structural operational semantics for weak bisimulations
• Title not available (Why is that?)
• Algebra of communicating processes with abstraction
• Branching time and abstraction in bisimulation semantics
• A Theory of Communicating Sequential Processes
• Title not available (Why is that?)
• Specification-oriented semantics for communicating processes
• Branching bisimilarity is an equivalence indeed!
• Rooted branching bisimulation as a congruence
• Divide and congruence applied to \(\eta\)-bisimulation
• Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation
• Turning SOS rules into equations
• Ordered SOS process languages for branching and eager bisimulations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Processes, Terms and Cycles: Steps on the Road to Infinity

Cited In (15)

• Probabilistic divide \& congruence: branching bisimilarity
• Theoretical Aspects of Computing – ICTAC 2005
• Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity
• SOS formats and meta-theory: 20 years after
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Comparing the expressiveness of the \(\pi \)-calculus and CCS
• A congruence format for name-passing calculi
• Up-to Techniques for Branching Bisimilarity
• Characteristic invariants in Hennessy-Milner logic
• Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity
• Weak Bisimulation as a Congruence in MSOS
• On constructibility and unconstructibility of LTS operators from other LTS operators
• Ensuring liveness properties of distributed systems: open problems
• Notes on generative probabilistic bisimulation
• A general account of coinduction up-to

This page was built for publication: On cool congruence formats for weak bisimulations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q549196)