A Static Analysis Technique for Graph Transformation Systems
Explore this paper's citation graph
Summary
An algorithm is presented which, given a graph transformation system and a start graph, produces a finite structure consisting of a hypergraph decorated with transitions (Petri graph) which can be seen as an approximation of the Winskel style unfolding of theGraph transformation system.
- Published
- 2001-08-20
- Cited by
- 103
- References
- 18
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:15945686
References
- Handbook of graph grammars and computing by graph transformation: vol. 2: applications, languages, and tools
- Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations
- Parallel composition and unfolding semantics of graph grammars
- Modelling Concurrent Computations: from Contextual Petri Nets to Graph Grammars
- Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution
- Petri Nets, Event Structures and Domains, Part I
- Petri Nets Are Monoids
- Model Checking Using Net Unfoldings
- An Improvement of McMillan's Unfolding Algorithm
- Integration of graph transformation and temporal logic for the specification of distributed systems
- Decidable Approximations of Sets of Descendants and Sets of Normal Forms
- Unfolding and Finite Prefix for Nets with Read Arcs
- Unfolding and Event Structure Semantics for Graph Grammars
- Concurrent Graph and Term Graph Rewriting
- Symbolic Model Checking
- Introduction to the Algebraic Theory of Graph Grammars (A Survey)
Cited by
- Graph transformation systems, Petri nets and Semilinear Sets: Checking for the Absence of Forbidden Paths in Graphs
- Summary 2: Graph Grammar Verification through Abstraction
- Towards the Automatic Verification of Inductive Invariants for Infinite State UML Models
- Search-based and goal-oriented refactoring using unfolding of graph transformation systems
- Analysis and verification of systems with dynamically evolving structure (Analyse und Verifikation von Systemen mit dynamischen Strukturveränderungen)
- Abstraction and abstraction refinement in the verification of graph transformation systems
- Search-Based Refactoring using Unfolding of Graph Transformation Systems
- Unfolding Shape Graphs
- 04241 Abstracts Collection - Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems
- Augur 2 - A New Version of a Tool for the Analysis of Graph Transformation Systems
- Analysing refactoring dependencies using unfolding of graph transformation systems
- Matching of Bigraphs
- GETGRATS: A summary of scientific results (with annotated bibliography)
- Unfolding semantics of graph transformation
- Verification of Random Graph Transformation Systems
- Incremental verification of inductive invariants for the run-time evolution of self-adaptive software-intensive systems
- Relating SPO and DPO graph rewriting with Petri nets having read, inhibitor and reset arcs
- Interpretation, Transformation and Model Checking of Semi-formal Diagram Notations
- Verifying a Behavioural Logic for Graph Transformation Systems
- Formal Specification and Analysis of Domain Specific Models Using Maude
Related papers
No related papers recorded.