Adhesive and quasiadhesive categories
From MaRDI portal
Publication:5313719
Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30) Categories admitting limits (complete categories), functors preserving limits, completions (18A35) Categorical structures (18D99) Grammars and rewriting systems (68Q42) Abstract data types; algebraic specification (68Q65)
Recommendations
Cites work
- A Concurrent Graph Semantics for Mobile Ambients1 1Research partly supported by the EC TMR Network General Theory of Graph Transformation Systems (GETGRATS); by the EC Esprit WG Applications of Graph Transformations (APPLIGRAPH); and by the Italian MURST
- Bitonal membrane systems: interactions of biological membranes
- Foundations of Software Science and Computation Structures
- Foundations of Software Science and Computation Structures
- Handbook of Graph Grammars and Computing by Graph Transformation
- Handbook of Graph Grammars and Computing by Graph Transformation
- scientific article; zbMATH DE number 3959364 (Why is no real title available?)
- scientific article; zbMATH DE number 177439 (Why is no real title available?)
- scientific article; zbMATH DE number 3555491 (Why is no real title available?)
- scientific article; zbMATH DE number 3633737 (Why is no real title available?)
- scientific article; zbMATH DE number 1950547 (Why is no real title available?)
- scientific article; zbMATH DE number 2059571 (Why is no real title available?)
- scientific article; zbMATH DE number 1863157 (Why is no real title available?)
- scientific article; zbMATH DE number 1437942 (Why is no real title available?)
- Introduction to extensive and distributive categories
- Parallelism and concurrency in high-level replacement systems
- Quasitoposes, Quasiadhesive Categories and Artin Glueing
- Van Kampen theorems for categories of covering morphisms in lextensive categories
Cited in
(only showing first 100 items - show all)- Synthesising CCS bisimulation using graph rewriting
- How to glue derived categories
- The PBPO graph transformation approach
- Unfolding-based diagnosis of systems with an evolving topology
- On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems
- A categorial approach to reaction systems: first steps
- Rewriting theory for the life sciences: a unifying theory of CTMC semantics
- Partial pullback complement rewriting along admissible matches
- A generalized concurrent rule construction for double-pushout rewriting: generalized concurrency theorem and language-preserving rule applications
- Concurrency theorems for non-linear rewriting theories
- A generalized concurrent rule construction for double-pushout rewriting
- Transformations of reaction systems over categories by means of epi-mono factorization and functors
- Finite limits and anti-unification in substitution categories
- Constructing constraint-preserving interaction schemes in adhesive categories
- Double-pushout-rewriting in \(S\)-Cartesian functor categories: rewriting theory and application to partial triple graphs
- Monographs, a category of graph structures
- Adhesive subcategories of functor categories with instantiation to partial triple graphs
- Rule-based transformation of graph rewriting rules: towards higher-order graph grammars
- Partial pullback complement rewriting
- Accretive computation of global transformations
- Moment semantics for reversible rule-based systems
- On term graphs as an adhesive category
- Parallelism and concurrency in adhesive high-level replacement systems with negative application conditions
- Towards algebraic high-level systems as weak adhesive HLR categories
- Adhesive DPO parallelism for monic matches
- Modelling calculi with name mobility using graphs with equivalences
- Van Kampen colimits as bicolimits in Span
- Unfolding Grammars in Adhesive Categories
- An institution for graph transformation
- Reconfigurable Petri nets with transition priorities and inhibitor arcs
- Confluence of graph rewriting with interfaces
- Adhesivity is not enough: local Church-Rosser revisited
- Sesqui-pushout rewriting with type refinements
- Rule algebras for adhesive categories
- Combinatorial conversion and moment bisimulation for stochastic rewriting systems
- Transformations in Reconfigurable Place/Transition Systems
- Unfolding-Based Diagnosis of Systems with an Evolving Topology
- Toposes Are Adhesive
- Quasitoposes, Quasiadhesive Categories and Artin Glueing
- Collagories for relational adhesive rewriting
- Lax pullback complements and pullbacks of spans
- Lex colimits
- Recognizable languages of arrows and cospans
- Some facets of Horn covarieties in a category
- Equilibrium and termination. II: The case of Petri nets
- Finitary \(\mathcal{M}\)-adhesive categories
- Hereditary pushouts reconsidered
- scientific article; zbMATH DE number 7453087 (Why is no real title available?)
- scientific article; zbMATH DE number 7453970 (Why is no real title available?)
- Graph surfing in reaction systems from a categorial perspective
- scientific article; zbMATH DE number 7456054 (Why is no real title available?)
- scientific article; zbMATH DE number 7456055 (Why is no real title available?)
- Conditional bisimilarity for reactive systems
- Incremental concurrent model synchronization using triple graph grammars
- String diagram rewrite theory II: Rewriting with symmetric monoidal structure
- String diagram rewrite theory. I: Rewriting with Frobenius structure
- Rule algebras for adhesive categories
- Rewriting theory for the life sciences: a unifying theory of CTMC semantics
- The Greenberg Functor is Site Cocontinuous
- Towards Secrecy for Rewriting in Weakly Adhesive Categories
- A Note on an Old-Fashioned Algebra for (Disconnected) Graphs
- Allegories and collagories for transformation of graph structures considered as coalgebras
- Foundations of Software Science and Computation Structures
- Deriving Bisimulation Congruences in the Presence of Negative Application Conditions
- Collagories: relation-algebraic reasoning for gluing constructions
- Processes and unfoldings: concurrent computations in adhesive categories
- Finitary \(\mathcal{M}\)-adhesive categories
- RPO semantics for mobile ambients
- Multi-amalgamation of rules with application conditions in \(\mathcal{M}\)-adhesive categories
- -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
- Formal analysis of model transformations based on triple graph grammars
- Analysis of permutation equivalence in \(\mathcal{M}\)-adhesive transformation systems with negative application conditions
- String diagram rewrite theory III: Confluence with and without Frobenius
- Fundamentals of compositional rewriting theory
- Computational category-theoretic rewriting
- A Category of Surface-Embedded Graphs
- Dependent Optics
- A generic construction for crossovers of graph-like structures and its realization in the Eclipse Modeling Framework
- A new criterion for \(\mathcal{M}, \mathcal{N} \)-adhesivity, with an application to hierarchical graphs
- A simple criterion for \(\mathcal{M}, \mathcal{N}\)-adhesivity
- A lattice-theoretical perspective on adhesive categories
- Symbolic graphs for attributed graph constraints
- A Generic Construction for Crossovers of Graph-Like Structures
- Computational Category-Theoretic Rewriting
- Finding the right way to Rome: effect-oriented graph transformation
- Termination of graph transformation systems using weighted subgraph counting
- Fuzzy presheaves are quasitoposes
- A living monograph for graph transformation
- Lax pullback complements in partial morphism categories
- Algebraic properties and transformations of monographs
- Thomason-type model structures on simplicial complexes and graphs
- Conditional bisimilarity for reactive systems
- Rewriting modulo traced comonoid structure
- Coinductive techniques for checking satisfiability of generalized nested conditions
- Left-linear rewriting in adhesive categories
- \( \mathsf{Q}\)-\(\mathbf{Set}\) is not generally a topos
- Subsumptions of algebraic rewrite rules
- Moving a derivation along a derivation preserves the spine in adhesive categories
- On the axioms of \(\mathcal{M},\mathcal{N}\)-adhesive categories
- Rewriting for symmetric monoidal categories with commutative (co)monoid structure
This page was built for publication: Adhesive and quasiadhesive categories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5313719)
