The following pages link to (Q4951112):
Displaying 39 items.
- Polynomial graph transformability (Q418788) (← links)
- Correct transformation: from object-based graph grammars to PROMELA (Q436353) (← links)
- Verification of graph grammars using a logical approach (Q436370) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- The complexity of tree automata and XPath on grammar-compressed trees (Q860863) (← links)
- The generative power of delegation networks (Q897662) (← links)
- A framework for the verification of infinite-state graph transformation systems (Q937301) (← links)
- A polynomial nominal unification algorithm (Q944382) (← links)
- An algebraic semantics for MOF (Q973052) (← links)
- Synthesising CCS bisimulation using graph rewriting (Q1004288) (← links)
- Formal software specification with refinements and modules of typed graph transformation systems (Q1608315) (← links)
- Hierarchical graph transformation (Q1608318) (← links)
- Graph traversal and graph transformation (Q1885899) (← links)
- Graph transformation through graph surfing in reaction systems (Q2011207) (← links)
- Concurrent semantics for fusions: weak prime domains and connected event structures (Q2051794) (← links)
- Minimisation of event structures (Q2084951) (← links)
- Behavioural logics for configuration structures (Q2123053) (← links)
- A hierarchy of dismantlings in graphs (Q2185916) (← links)
- Parallel rewriting of attributed graphs (Q2215963) (← links)
- Parallel coherent graph transformations (Q2237338) (← links)
- A calculus of concurrent graph-rewriting processes (Q2291821) (← links)
- Rule-based transformation of graph rewriting rules: towards higher-order graph grammars (Q2355681) (← links)
- Graph-based specification of access control policies (Q2486563) (← links)
- Function simulation, graph grammars and colourings (Q2855758) (← links)
- Adhesive DPO Parallelism for Monic Matches (Q2867888) (← links)
- Verification of Random Graph Transformation Systems (Q2867889) (← links)
- Modeling Pointer Redirection as Cyclic Term-graph Rewriting (Q2867899) (← links)
- Modelling Calculi with Name Mobility using Graphs with Equivalences (Q2867900) (← links)
- Term-graph Rewriting in Tom Using Relative Positions (Q2870309) (← links)
- Universal Boolean Systems (Q2870310) (← links)
- Undecidable Control Conditions in Graph Transformation Units (Q2873611) (← links)
- On Term-Graph Rewrite Strategies (Q2873679) (← links)
- An Institution for Graph Transformation (Q2890329) (← links)
- Reachability in Graph Transformation Systems and Slice Languages (Q2947215) (← links)
- The Edge of Graph Transformation — Graphs for Behavioural Specification (Q3059705) (← links)
- Parallelism in AGREE Transformations (Q3187802) (← links)
- On the Complexity of Local Graph Transformations (Q5092357) (← links)
- Adhesive and quasiadhesive categories (Q5313719) (← links)
- Incidence hypergraphs: the categorical inconsistency of set-systems and a characterization of quiver exponentials (Q6116558) (← links)
