scientific article; zbMATH DE number 919847
From MaRDI portal
Publication:4890712
zbMath0854.68055MaRDI QIDQ4890712
Reiko Heckel, Annegret Habel, Gabriele Taentzer
Publication date: 25 August 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (35)
Theorem proving graph grammars with attributes and negative application conditions ⋮ On the Specification and Verification of Model Transformations ⋮ Structural and behavioural compatibility of graphical service specifications ⋮ Polymorphic Sesqui-Pushout Graph Rewriting ⋮ Transformation of variants of Petri nets into context-dependent fusion grammars ⋮ Conditional Bigraphs ⋮ Initial Conflicts for Transformation Rules with Nested Application Conditions ⋮ Patch Graph Rewriting ⋮ A Simulator for Probabilistic Timed Graph Transformation Systems with Complex Large-Scale Topologies ⋮ Explicit State Model Checking for Graph Grammars ⋮ Symbolic graphs for attributed graph constraints ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Embedding and Confluence of Graph Transformations with Negative Application Conditions ⋮ Attributed Graph Constraints ⋮ Development of Correct Graph Transformation Systems ⋮ Subobject transformation systems ⋮ Modelling Dynamic Software Architectures using Typed Graph Grammars ⋮ On the interleaving semantics of transformation units — A step into GRACE ⋮ Variability-based model transformation: formal foundation and application ⋮ Graph grammars according to the type of input and manipulated data: a survey ⋮ Probabilistic timed graph transformation systems ⋮ A navigational logic for reasoning about graph properties ⋮ How to Specify a Graph Transformation Approach ⋮ Reasoning with graph constraints ⋮ On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems ⋮ Extended Triple Graph Grammars with Efficient and Compatible Graph Translators ⋮ Deriving Bisimulation Congruences in the Presence of Negative Application Conditions ⋮ A Logic of Graph Constraints ⋮ Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality ⋮ Parallelism and Concurrency in Adhesive High-Level Replacement Systems with Negative Application Conditions ⋮ 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
This page was built for publication:
