Pages that link to "Item:Q673123"
From MaRDI portal
The following pages link to Structural operational semantics for weak bisimulations (Q673123):
Displayed 32 items.
- Modelling and analysing neural networks using a hybrid process algebra (Q264526) (← links)
- Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity (Q418189) (← links)
- A general account of coinduction up-to (Q523132) (← links)
- On cool congruence formats for weak bisimulations (Q549196) (← links)
- Fair testing (Q865623) (← links)
- SOS formats and meta-theory: 20 years after (Q877025) (← links)
- Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes (Q974113) (← links)
- A precongruence format for should testing preorder (Q974134) (← links)
- A conservative look at operational semantics with variable binding (Q1273877) (← links)
- Branching bisimilarity is an equivalence indeed! (Q1350620) (← links)
- Towards a unified view of bisimulation: A comparative study (Q1575240) (← links)
- Finite axiom systems for testing preorder and De Simone process languages (Q1575273) (← links)
- Language preorder as a precongruence (Q1575654) (← links)
- Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity (Q1680509) (← links)
- Tile formats for located and mobile systems. (Q1854326) (← links)
- Bisimilarity of open terms. (Q1854331) (← links)
- Ordered SOS process languages for branching and eager bisimulations (Q1854563) (← links)
- Rule formats for compositional non-interference properties (Q1878717) (← links)
- Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation (Q1878718) (← links)
- A format for semantic equivalence comparison (Q1884897) (← links)
- Rooted branching bisimulation as a congruence (Q1975965) (← links)
- Probabilistic divide \& congruence: branching bisimilarity (Q2007735) (← links)
- Ensuring liveness properties of distributed systems: open problems (Q2011206) (← links)
- Reusing artifact-centric business process models: a behavioral consistent specialization approach (Q2199060) (← links)
- Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence (Q2272990) (← links)
- On constructibility and unconstructibility of LTS operators from other LTS operators (Q2340256) (← links)
- The expressiveness of CSP with priority (Q2520703) (← links)
- Notes on Generative Probabilistic Bisimulation (Q2866317) (← links)
- Weak Bisimilarity Coalgebraically (Q2888485) (← links)
- Weak Bisimulation as a Congruence in MSOS (Q2945724) (← links)
- Up-to Techniques for Branching Bisimilarity (Q3297777) (← links)
- Bisimulations of Probabilistic Boolean Networks (Q5103921) (← links)