Deriving Bisimulation Congruences with Borrowed Contexts
From MaRDI portal
Publication:3612482
Recommendations
- Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
- Deriving Bisimulation Congruences in the Presence of Negative Application Conditions
- Deriving bisimulation congruences: a 2-categorical approach
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- From rewrite rules to bisimulation congruences
- Deriving Bisimulation Congruences for Conditional Reactive Systems
- scientific article; zbMATH DE number 1759615
- CONCUR 2005 – Concurrency Theory
- Deriving Bisimulations by Simplifying Partitions
- Foundations of Software Science and Computation Structures
Cited in
(10)- scientific article; zbMATH DE number 1759615 (Why is no real title available?)
- Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
- From rewrite rules to bisimulation congruences
- Deriving labelled transition systems -- a structural approach
- CONCUR 2005 – Concurrency Theory
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Deriving Bisimulation Congruences in the Presence of Negative Application Conditions
- \textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics
- Foundations of Software Science and Computation Structures
- Deriving Bisimulation Congruences for Conditional Reactive Systems
This page was built for publication: Deriving Bisimulation Congruences with Borrowed Contexts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612482)