The following pages link to (Q4194478):
Displayed 50 items.
- Amalgamation of domain specific languages with behaviour (Q347380) (← links)
- Modelling evolution of communication platforms and scenarios based on transformations of high-level nets and processes (Q418764) (← links)
- Correct transformation: from object-based graph grammars to PROMELA (Q436353) (← links)
- How to delete categorically -- two pushout complement constructions (Q631570) (← links)
- Locating the contractum in the double pushout approach (Q672236) (← links)
- Confluence for graph transformations (Q672753) (← links)
- On categorical graph grammars integrating structural transformations and operations on labels (Q685458) (← links)
- Algebraic approach to single-pushout graph transformation (Q685460) (← links)
- Parallel and distributed derivations in the single-pushout approach (Q685462) (← links)
- On structured graph grammars. I (Q753498) (← links)
- Pushout-complements and basic concepts of grammars in toposes (Q757576) (← links)
- Note on node-rewriting graph grammars (Q796997) (← links)
- Structural and behavioural compatibility of graphical service specifications (Q861295) (← links)
- Construction and properties of adhesive and weak adhesive high-level replacement categories (Q934669) (← links)
- A framework for the verification of infinite-state graph transformation systems (Q937301) (← links)
- Adaptive star grammars and their languages (Q986544) (← links)
- An overview of the K semantic framework (Q987974) (← links)
- Graph theoretic closure properties of the family of boundary NLC graph languages (Q1084870) (← links)
- Net processes correspond to derivation processes in graph grammars (Q1085621) (← links)
- Combinatorial properties of boundary NLC graph languages (Q1089808) (← links)
- String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing (Q1089809) (← links)
- Characteristics of graph languages generated by edge replacement (Q1098320) (← links)
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars (Q1102759) (← links)
- Comparison of two graph-rewrite systems (Q1111401) (← links)
- Confluence of indirection reductions in graph rewrite systems (Q1113692) (← links)
- A characterization of context-free string languages by directed node- label controlled graph grammars (Q1154289) (← links)
- Decision problems for node label controlled graph grammars (Q1155373) (← links)
- On the generative power of sequential and parallel programmed graph grammars (Q1163378) (← links)
- Graph grammars with neighbourhood-controlled embedding (Q1165019) (← links)
- Graph grammars and operational semantics (Q1165029) (← links)
- Processes of transforming structures (Q1166273) (← links)
- Foundations of rule-based design of modular systems (Q1176249) (← links)
- Conditional rewriting logic as a unified model of concurrency (Q1190488) (← links)
- Term graph rewriting and garbage collection using opfibrations (Q1331928) (← links)
- CGOOD, a categorical graph-oriented object data model (Q1350521) (← links)
- Parallel high-level replacement systems (Q1389763) (← links)
- Algebraic transformation of unary partial algebras. I: Double-pushout approach (Q1390937) (← links)
- Formal software specification with refinements and modules of typed graph transformation systems (Q1608315) (← links)
- Amalgamation of graph transformations: a synchronization mechanism (Q1822505) (← links)
- Graph transformation through graph surfing in reaction systems (Q2011207) (← links)
- On linearly oriented pullback and classes of algebras (Q2188389) (← links)
- Theorem proving graph grammars with attributes and negative application conditions (Q2358623) (← links)
- Categorical approach to the construction of fuzzy graph grammars (Q2371725) (← links)
- Fault trees on a diet: automated reduction by graph rewriting (Q2403528) (← links)
- Specifying graph languages with type graphs (Q2423749) (← links)
- Confluence theory for graphs (Q2464760) (← links)
- The uniqueness condition for the double pushout transformation of algebras (Q2486006) (← links)
- A general framework for types in graph rewriting (Q2581012) (← links)
- Towards Algebraic High-Level Systems as Weak Adhesive HLR Categories (Q2864378) (← links)
- Bigraphs and Their Algebra (Q2870188) (← links)