Implementing a CTL model checker with G, a language for programming graph neural networks

DOI10.1007/978-3-031-35355-0_4zbMATH Open1543.68192MaRDI QIDQ6535461FDOQ6535461

Authors: Matteo Belenchia, Flavio Corradini, Michela Quadrini, Michele Loreti 

Publication date: 11 January 2024

Recommendations

• The logic of graph neural networks
• Graph rewriting for graph neural networks
• Beyond graph neural networks with lifted relational neural networks
• Using graph convolutional networks for approximate reasoning with abstract argumentation frameworks: a feasibility study

zbMATH Keywords

model checkingcomputation tree logicgraph neural networks

Mathematics Subject Classification ID

Artificial neural networks and deep learning (68T07) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Semantics with applications: an appetizer.
• A logic for reasoning about time and reliability
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The mu-calculus and Model Checking
• A design of GPU-based quantitative model checking
• BFS-based model checking of linear-time properties with an application on GPUs

Cited In (2)

• A gaze into the internal logic of graph neural networks, with logic
• Graph rewriting for graph neural networks

This page was built for publication: Implementing a CTL model checker with \(\mu \mathcal{G}\), a language for programming graph neural networks

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