Petri nets: an introduction
Information and Computation
Decidability of a temporal logic problem for petri nets
IDTC Second international conference on Database theory
A taxonomy of fairness and temporal logic problems for Petri nets
Theoretical Computer Science
Handbook of theoretical computer science (vol. B)
Model checking using net unfoldings
TAPSOFT '93 Selected papers of the colloquium on Formal approaches of software engineering
Property preserving abstractions for the verification of concurrent systems
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Abstract interpretation: a semantics-based tool for program analysis
Handbook of logic in computer science (vol. 4)
ACM Computing Surveys (CSUR)
Fundamenta Informaticae - Special issue on graph transformations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
The expression of graph properties and graph transformations in monadic second-order logic
Handbook of graph grammars and computing by graph transformation
Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution
Handbook of graph grammars and computing by graph transformation: vol. 2: applications, languages, and tools
Symbolic Model Checking
Concatenable Graph Processes: Relating Processes and Derivation Traces
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
A Static Analysis Technique for Graph Transformation Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Unfolding and Event Structure Semantics for Graph Grammars
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Decidable Approximations of Sets of Descendants and Sets of Normal Forms
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Introduction to the Algebraic Theory of Graph Grammars (A Survey)
Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology
A General Framework for Types in Graph Rewriting
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Safety and Liveness in Branching Time
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Verification of Random Graph Transformation Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Augur 2 --- A New Version of a Tool for the Analysis of Graph Transformation Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
An Efficient Solution for Model Checking Graph Transformation Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A framework for the verification of infinite-state graph transformation systems
Information and Computation
Unfolding Graph Transformation Systems: Theory and Applications to Verification
Concurrency, Graphs and Models
Explicit State Model Checking for Graph Grammars
Concurrency, Graphs and Models
Abstracting Complex Data Structures by Hyperedge Replacement
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Formal Verification of Graph Grammars using Mathematical Induction
Electronic Notes in Theoretical Computer Science (ENTCS)
Joint Optimization and Reachability Analysis in Graph Transformation Systems with Time
Electronic Notes in Theoretical Computer Science (ENTCS)
Verifying a Behavioural Logic for Graph Transformation Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A logic for analyzing abstractions of graph transformation systems
SAS'03 Proceedings of the 10th international conference on Static analysis
A temporal graph logic for verification of graph transformation systems
WADT'06 Proceedings of the 18th international conference on Recent trends in algebraic development techniques
Verification of graph transformation systems with context-free specifications
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Juggrnaut: Graph Grammar Abstraction for Unbounded Heap Structures
Electronic Notes in Theoretical Computer Science (ENTCS)
On the concurrent semantics of algebraic graph grammars
Formal Methods in Software and Systems Modeling
Verification of graph grammars using a logical approach
Science of Computer Programming
Specifying and verifying UML activity diagrams via graph transformation
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
On the use of alloy to analyze graph transformation systems
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Weakest preconditions for high-level programs
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Counterexample-Guided abstraction refinement for the analysis of graph transformation systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A model-driven framework for guided design space exploration
ASE '11 Proceedings of the 2011 26th IEEE/ACM International Conference on Automated Software Engineering
Exploiting over- and under-approximations for infinite-state counterpart models
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Specification and verification of modal properties for structured systems
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
| Hi-index | 0.00 |
We propose a technique for the analysis of graph transformation systems based on the construction of finite structures approximating the behaviour of such systems with arbitrary accuracy. Following a classical approach, one can construct a chain of finite under-approximations (k-truncations) of the Winskel's style unfolding of a graph grammar. More interestingly, also a chain of finite over-approximations (k-coverings) of the unfolding can be constructed and both chains converge (in a categorical sense) to the full unfolding. The finite over- and under-approximations can be used to check properties of a graph transformation system, like safety and liveness properties, expressed in (meaningful fragments of) the modal 碌-calculus. This is done by embedding our approach in the general framework of abstract interpretation.