Deriving Bisimulation Congruences in the Presence of Negative Application Conditions
From MaRDI portal
Publication:5458376
DOI10.1007/978-3-540-78499-9_29zbMath1139.68043MaRDI QIDQ5458376
Barbara König, Hartmut Ehrig, Guilherme Rangel
Publication date: 11 April 2008
Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78499-9_29
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Deriving Bisimulation Congruences in the Presence of Negative Application Conditions, Behavior Preservation in Model Refactoring Using DPO Transformations with Borrowed Contexts
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A calculus of mobile processes. I
- A calculus of mobile processes. II
- Pure bigraphs: structure and dynamics
- Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
- On the proof method for bisimulation
- Handbook of Graph Grammars and Computing by Graph Transformation
- Graph Transformations
- Foundations of Software Science and Computation Structures
- Adhesive and quasiadhesive categories
- Deriving Bisimulation Congruences in the Presence of Negative Application Conditions
- Semantic Barbs and Biorthogonality
- Bisimulation verification using the up to techniques