A Temporal Graph Logic for Verification of Graph Transformation Systems
DOI10.1007/978-3-540-71998-4_1zbMATH Open1196.68154OpenAlexW1507479492WikidataQ56501823 ScholiaQ56501823MaRDI QIDQ3591071FDOQ3591071
Authors: Paolo Baldan, Andrea Corradini, Barbara König, Alberto Lluch Lafuente 
Publication date: 10 September 2007
Published in: Recent Trends in Algebraic Development Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-71998-4_1
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (17)
- A presheaf semantics for quantified temporal logics
- Reachability analysis of reversal-bounded automata on series-parallel graphs
- A framework for the verification of infinite-state graph transformation systems
- Verifying a behavioural logic for graph transformation systems
- A Logic of Graph Constraints
- Reasoning with graph constraints
- Verifying graph transformation systems with description logics
- Temporal Graph Queries to Support Software Evolution
- Explicit State Model Checking for Graph Grammars
- Metric temporal graph logic over typed attributed graphs
- Title not available (Why is that?)
- Reachability analysis of reversal-bounded automata on series-parallel graphs
- Automated deduction in a graphical temporal logic
- Specification and verification of a linear-time temporal logic for graph transformation
- A Modal-Logic Based Graph Abstraction
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: A Temporal Graph Logic for Verification of Graph Transformation Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3591071)
