Weak Adhesive High-Level Replacement Categories and Systems: A Unifying Framework for Graph and Petri Net Transformations

DOI10.1007/11780274_13zbMath1133.68055OpenAlexW2130252364MaRDI QIDQ5757943

Hartmut Ehrig, Ulrike Prange

Publication date: 7 September 2007

Published in: Algebra, Meaning, and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11780274_13

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categories admitting limits (complete categories), functors preserving limits, completions (18A35)

Related Items

Van Kampen Colimits as Bicolimits in Span ⋮ Grammar Morphisms and Weakly Adhesive Categories ⋮ Construction and properties of adhesive and weak adhesive high-level replacement categories ⋮ Towards Secrecy for Rewriting in Weakly Adhesive Categories ⋮ Single pushout rewriting in comprehensive systems of graph-like structures ⋮ Comprehensive systems: a formal foundation for multi-model consistency management