A taxonomy of fairness and temporal logic problems for Petri nets
Theoretical Computer Science
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)
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
Model-Checking with Coverability Graphs
Formal Methods in System Design
A Fully Abstract Model for Graph-Interpreted Temporal Logic
TAGT'98 Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations
Approximating the Behaviour of Graph Transformation Systems
ICGT '02 Proceedings of the First International Conference on Graph Transformation
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
Verifying temporal heap properties specified via evolution logic
ESOP'03 Proceedings of the 12th European conference on Programming
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Model checking quantified computation tree logic
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
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 framework for the verification of infinite-state graph transformation systems
Information and Computation
Explicit State Model Checking for Graph Grammars
Concurrency, Graphs and Models
Graphical encoding of a spatial logic for the π-calculus
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
Counterpart semantics for a second-order µ-calculus
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Combining Proof and Model-checking to Validate Reconfigurable Architectures
Electronic Notes in Theoretical Computer Science (ENTCS)
Using temporal logic for dynamic reconfigurations of components
FACS'10 Proceedings of the 7th international conference on Formal Aspects of Component Software
Counterpart Semantics for a Second-Order μ-Calculus
Fundamenta Informaticae - Recent Developments in the Theory of Graph Transformation, 2010
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 extend our approach for verifying properties of graph transformation systems using suitable abstractions. In the original approach properties are specified as formulae of a propositional temporal logic whose atomic predicates are monadic second-order graph formulae. We generalize this aspect by considering more expressive logics, where edge quantifiers and temporal modalities can be interleaved, a feature which allows, e.g., to trace the history of objects in time. After characterizing fragments of the logic which can be safely checked on the approximations, we show how the verification of the logic over graph transformation systems can be reduced to the verification of a logic over suitably defined Petri nets.