Deriving Bisimulation Congruences in the Presence of Negative Application Conditions
From MaRDI portal
Publication:5458376
Recommendations
- Deriving Bisimulation Congruences with Borrowed Contexts
- Deriving Bisimulation Congruences for Conditional Reactive Systems
- Foundations of Software Science and Computation Structures
- Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
- scientific article; zbMATH DE number 1759615
Cites work
- scientific article; zbMATH DE number 5604126 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1759615 (Why is no real title available?)
- scientific article; zbMATH DE number 919847 (Why is no real title available?)
- A calculus of mobile processes. I
- A calculus of mobile processes. II
- Adhesive and quasiadhesive categories
- Bisimulation verification using the up to techniques
- Deriving Bisimulation Congruences in the Presence of Negative Application Conditions
- Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
- Foundations of Software Science and Computation Structures
- Graph Transformations
- Handbook of Graph Grammars and Computing by Graph Transformation
- On the proof method for bisimulation
- Pure bigraphs: structure and dynamics
- Semantic Barbs and Biorthogonality
Cited in
(5)- Deriving Bisimulation Congruences with Borrowed Contexts
- From rewrite rules to bisimulation congruences
- Deriving Bisimulation Congruences in the Presence of Negative Application Conditions
- Behavior Preservation in Model Refactoring Using DPO Transformations with Borrowed Contexts
- Deriving Bisimulation Congruences for Conditional Reactive Systems
This page was built for publication: Deriving Bisimulation Congruences in the Presence of Negative Application Conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458376)