Deriving Bisimulation Congruences in the Presence of Negative Application Conditions

DOI10.1007/978-3-540-78499-9_29zbMath1139.68043OpenAlexW1528716241MaRDI 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

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Behavior Preservation in Model Refactoring Using DPO Transformations with Borrowed Contexts ⋮ Deriving Bisimulation Congruences in the Presence of Negative Application Conditions

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

This page was built for publication: Deriving Bisimulation Congruences in the Presence of Negative Application Conditions