scientific article; zbMATH DE number 919847
From MaRDI portal
Publication:4890712
zbMATH Open0854.68055MaRDI QIDQ4890712FDOQ4890712
Authors: R. Heckel, Annegret Habel, Gabriele Taentzer 
Publication date: 25 August 1996
Title of this publication is not available (Why is that?)
Recommendations
- Unfolding graph grammars with negative application conditions
- scientific article; zbMATH DE number 3988733
- Theorem proving graph grammars with attributes and negative application conditions
- Matrix Graph Grammars with Application Conditions
- On the expressive power of algebraic graph grammars with application conditions
- scientific article; zbMATH DE number 177453
- scientific article; zbMATH DE number 177436
- scientific article; zbMATH DE number 17539
- Deterministic graph grammars
- scientific article; zbMATH DE number 3872712
Cited In (42)
- On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems
- Variability-based model transformation: formal foundation and application
- Probabilistic timed graph transformation systems
- Patch graph rewriting
- A navigational logic for reasoning about graph properties
- On the interleaving semantics of transformation units -- a step into GRACE
- Attributed Graph Constraints
- How to specify a graph transformation approach: a meta model for \textsc{Fujaba}
- Graph grammars according to the type of input and manipulated data: a survey
- Title not available (Why is that?)
- Theorem proving graph grammars with attributes and negative application conditions
- Modelling dynamic software architectures using typed graph grammars
- On the power of local graph expansion grammars with and without additional restrictions
- A Logic of Graph Constraints
- Title not available (Why is that?)
- Reasoning with graph constraints
- Development of Correct Graph Transformation Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Deriving Bisimulation Congruences in the Presence of Negative Application Conditions
- Transformation systems with incremental negative application conditions
- Initial conflicts for transformation rules with nested application conditions
- Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality
- On the Specification and Verification of Model Transformations
- Symbolic graphs for attributed graph constraints
- Explicit State Model Checking for Graph Grammars
- Extended triple graph grammars with efficient and compatible graph translators
- A simulator for probabilistic timed graph transformation systems with complex large-scale topologies
- Conditional bigraphs
- Transformation of variants of Petri nets into context-dependent fusion grammars
- Parallelism and concurrency in adhesive high-level replacement systems with negative application conditions
- Unfolding graph grammars with negative application conditions
- A graph-transformational approach for proving the correctness of reductions between NP-problems
- Matrix Graph Grammars with Application Conditions
- Structural and behavioural compatibility of graphical service specifications
- Embedding and Confluence of Graph Transformations with Negative Application Conditions
- Subobject transformation systems
- Polymorphic sesqui-pushout graph rewriting
- Modeling and verification of reliable messaging by graph transformation systems
- Simulation of generalised semi-Markov processes based on graph transformation systems
- Formal software specification with refinements and modules of typed graph transformation systems
- On the expressive power of algebraic graph grammars with application conditions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4890712)
