Towards Secrecy for Rewriting in Weakly Adhesive Categories

DOI10.1016/j.entcs.2009.06.041zbMath1291.68260OpenAlexW2041605867MaRDI QIDQ5166615

Tobias Heindel

Publication date: 27 June 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.06.041

zbMATH Keywords

verificationinteraction modelsadhesive categories

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42) Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30)

Related Items (max. 100)

A lattice-theoretical perspective on adhesive categories

Cites Work

• Unnamed Item
• Unnamed Item
• A calculus of mobile processes. I
• A calculus for cryptographic protocols: The spi calculus
• Graph attribution through sub-graphs
• Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
• Adhesive and quasiadhesive categories
• Weak Adhesive High-Level Replacement Categories and Systems: A Unifying Framework for Graph and Petri Net Transformations
• CONCUR 2003 - Concurrency Theory

This page was built for publication: Towards Secrecy for Rewriting in Weakly Adhesive Categories