Verifying a behavioural logic for graph transformation systems

MaRDI QIDQ2847775zbMATH OpenFDO

Authors Paolo Baldan, Andrea Corradini, Barbara König, Bernhard König

Publication date 11 September 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066104051400

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Verifying graph transformation systems with description logics
• Verification of graph transformation systems with context-free specifications
• A Temporal Graph Logic for Verification of Graph Transformation Systems
• Towards the Verification of Attributed Graph Transformation Systems
• Modeling and verifying graph transformations in proof assistants
• Unfolding Graph Transformation Systems: Theory and Applications to Verification
• scientific article; zbMATH DE number 2090850

Cited in

(17)

• Verification of graph grammars using a logical approach
• A Temporal Graph Logic for Verification of Graph Transformation Systems
• Application of Graph Transformation in Verification of Dynamic Systems
• Proving correctness of logically decorated graph rewriting systems
• scientific article; zbMATH DE number 2016064 (Why is no real title available?)
• Proceedings of the workshop on graph transformation for concurrency and verification (GT-VC 2006), Bonn, Germany, August 31, 2006
• scientific article; zbMATH DE number 2090850 (Why is no real title available?)
• The Edge of Graph Transformation — Graphs for Behavioural Specification
• Specification and verification of a linear-time temporal logic for graph transformation
• CONCUR 2004 - Concurrency Theory
• Quantitative \(\mu\)-calculus and CTL defined over constraint semirings
• Exploiting over- and under-approximations for infinite-state counterpart models
• Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations
• A framework for the verification of infinite-state graph transformation systems
• Two-level reasoning about graph transformation programs
• Verifying graph transformation systems with description logics
• From hidden to visible: a unified framework for transforming behavioral theories into rewrite theories

This page was built for publication: Verifying a behavioural logic for graph transformation systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2847775)