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

DOI10.1017/S0960129512000382MaRDI QIDQ5740378zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
• \(\mathcal M, \mathcal N\)-adhesive transformation systems
• Transformation systems with incremental negative application conditions
• \(\mathcal M\)-adhesive transformation systems with nested application conditions. II: Embedding, critical pairs and local confluence
• Weak Adhesive High-Level Replacement Categories and Systems: A Unifying Framework for Graph and Petri Net Transformations

Cites work

• scientific article; zbMATH DE number 45228 (Why is no real title available?)
• Adhesive and quasiadhesive categories
• Correctness of high-level transformation systems relative to nested conditions
• Domain and event structure semantics for Petri nets with read and inhibitor arcs
• Finitary \(\mathcal{M}\)-adhesive categories
• Fundamentals of algebraic graph transformation
• Hereditary pushouts reconsidered
• Parallelism and concurrency in adhesive high-level replacement systems with negative application conditions
• Petri nets are monoids
• Process semantics of general inhibitor nets
• Semantics of inhibitor nets
• Subobject transformation systems

Cited in

(4)

• -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
• Parallelism in AGREE transformations
• Algebraic graph rewriting with controlled embedding
• Theorem proving graph grammars with attributes and negative application conditions

This page was built for publication: Analysis of permutation equivalence in \(\mathcal{M}\)-adhesive transformation systems with negative application conditions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5740378)