Baldan, Paolo and Corradini, Andrea and König, Barbara and Lluch-Lafuente, Alberto A Temporal Graph Logic for Verification of Graph Transformation Systems. In: Recent Trends in Algebraic Development Techniques (WADT’06). Lecture Notes in Computer Science, 4409 . Springer, pp. 1-20. ISBN 978-3-540-71997-7 (2006)Full text not available from this repository.
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. This requires the use of graph transition systems, a generalization of transition systems where states and transitions are mapped to graphs and graph morphisms, respectively, and of a corresponding notion of abstraction. 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.
|Item Type:||Book Section|
|Additional Information:||The final publication is available at www.springerlink.com.|
|Funders:||Research partially supported by the EU IST-2004-16004 SEnSOria, the MIUR PRIN 2005015824 ART, the DFG project SANDS and CRUI/DAAD Vigoni “Models based on Graph Transformation Systems: Analysis and Verification”.|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Users 30 not found.|
|Date Deposited:||07 Mar 2011 14:27|
|Last Modified:||11 Jul 2011 14:34|
Actions (login required)