Rooted branching bisimulation as a congruence
From MaRDI portal
Publication:1975965
Recommendations
Cites work
- \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
- A conservative look at operational semantics with variable binding
- A lattice-theoretical fixpoint theorem and its applications
- Bisimulation can't be traced
- Branching bisimilarity is an equivalence indeed!
- Branching time and abstraction in bisimulation semantics
- scientific article; zbMATH DE number 4199656 (Why is no real title available?)
- scientific article; zbMATH DE number 4160107 (Why is no real title available?)
- scientific article; zbMATH DE number 3990852 (Why is no real title available?)
- scientific article; zbMATH DE number 4011914 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 3744561 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 604884 (Why is no real title available?)
- scientific article; zbMATH DE number 4001464 (Why is no real title available?)
- scientific article; zbMATH DE number 2102773 (Why is no real title available?)
- scientific article; zbMATH DE number 794263 (Why is no real title available?)
- Language preorder as a precongruence
- Operational semantics of rewriting with priorities
- Process Algebra
- Processes and the denotational semantics of concurrency
- Structural operational semantics for weak bisimulations
- Structured operational semantics and bisimulation as a congruence
- Term-rewriting systems with rule priorities
- The algebra of communicating processes with empty process
- The meaning of negative premises in transition system specifications
- The well-founded semantics for general logic programs
- Transition system specifications with negative premises
Cited in
(30)- Language preorder as a precongruence
- Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity
- Ordered SOS process languages for branching and eager bisimulations
- Rule formats for compositional non-interference properties
- Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
- Branching time and orthogonal bisimulation equivalence
- Probabilistic divide \& congruence: branching bisimilarity
- Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
- Next-preserving branching bisimulation
- Operational semantics for Petri net components
- Notions of bisimulation and congruence formats for SOS with data
- A general SOS theory for the specification of probabilistic transition systems
- Notes on generative probabilistic bisimulation
- Divide and congruence: from decomposition of modal formulas to preservation of branching and -bisimilarity
- SOS rule formats for convex and abstract probabilistic bisimulations
- Divide and congruence. III: Stability \& divergence
- Some undecidable properties of SOS specifications
- Lean and full congruence formats for recursion
- Relating apartness and bisimulation
- A specification format for rooted branching bisimulation
- Theoretical Aspects of Computing – ICTAC 2005
- On cool congruence formats for weak bisimulations
- Rooted divergence-preserving branching bisimilarity is a congruence: a simpler proof
- Back to the format: a survey on SOS for probabilistic processes
- Dormancy-aware timed branching bisimilarity with an application to communication protocol analysis
- Rooted branching bisimulation as a congruence for probabilistic transition systems
- Raiders of the lost equivalence: probabilistic branching bisimilarity
- SOS formats and meta-theory: 20 years after
- Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes
- A precongruence format for should testing preorder
This page was built for publication: Rooted branching bisimulation as a congruence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1975965)
