The category of typed graph grammars and its adjunctions with categories of derivations (Q4645267): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Abstract graph derivations in the double pushout approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3210197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelism and concurrency of graph manipulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Petri nets are monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Petri nets, event structures and domains. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219122 / rank
 
Normal rank

Latest revision as of 20:33, 17 July 2024

scientific article; zbMATH DE number 6999570
Language Label Description Also known as
English
The category of typed graph grammars and its adjunctions with categories of derivations
scientific article; zbMATH DE number 6999570

    Statements

    The category of typed graph grammars and its adjunctions with categories of derivations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 January 2019
    0 references
    0 references
    transition system
    0 references
    direct derivation
    0 references
    graph transformation
    0 references
    graph grammar
    0 references
    injective morphism
    0 references
    0 references