Analysis of permutation equivalence in -adhesive transformation systems with negative application conditions

DOI10.1017/S0960129512000382zbMath1342.68179OpenAlexW2088279499MaRDI QIDQ5740378

Frank Hermann, Andrea Corradini, Hartmut Ehrig

Publication date: 26 July 2016

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129512000382

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42) Categories of machines, automata (18B20)

Related Items (3)

Theorem proving graph grammars with attributes and negative application conditions ⋮ Parallelism in AGREE Transformations ⋮ Algebraic graph rewriting with controlled embedding

Cites Work

• Unnamed Item
• Process semantics of general inhibitor nets
• Petri nets are monoids
• Subobject transformation systems
• Domain and event structure semantics for Petri nets with read and inhibitor arcs
• Fundamentals of algebraic graph transformation
• Semantics of inhibitor nets
• Parallelism and Concurrency in Adhesive High-Level Replacement Systems with Negative Application Conditions
• Correctness of high-level transformation systems relative to nested conditions
• Finitary $\mathcal{M}$ -Adhesive Categories
• Hereditary Pushouts Reconsidered
• Adhesive and quasiadhesive categories

This page was built for publication: Analysis of permutation equivalence in -adhesive transformation systems with negative application conditions