Optimistic and Pessimistic On-the-fly Analysis for Metric Temporal Graph Logic
From MaRDI portal
Publication:5100739
DOI10.1007/978-3-030-51372-6_16zbMath1502.68186OpenAlexW3037345683MaRDI QIDQ5100739
Lucas Sakizloglou, Holger Giese, Maria Maximova, Sven Schneider
Publication date: 1 September 2022
Published in: Graph Transformation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-51372-6_16
Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42) Temporal logic (03B44)
Related Items (3)
Bounded model checking for interval probabilistic timed graph transformation systems against properties of probabilistic metric temporal graph logic ⋮ Probabilistic Metric Temporal Graph Logic ⋮ Compositional analysis of probabilistic timed graph transformation systems
Uses Software
Cites Work
- Symbolic graphs for attributed graph constraints
- Probabilistic timed graph transformation systems
- A brief account of runtime verification
- Fundamentals of algebraic graph transformation
- Fundamental approaches to software engineering. 22nd international conference, FASE 2019, held as part of the European joint conferences on theory and practice of software, ETAPS 2019, Prague, Czech Republic, April 6--11, 2019. Proceedings
- Monitoring Metric First-Order Temporal Properties
- Lazy Graph Transformation
- Correctness of high-level transformation systems relative to nested conditions
- Delaying Constraint Solving in Symbolic Graph Transformation
- k-Inductive Invariant Checking for Graph Transformation Systems
- Formal Verification of Invariants for Attributed Graph Transformation Systems Based on Nested Attributed Graph Conditions
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
This page was built for publication: Optimistic and Pessimistic On-the-fly Analysis for Metric Temporal Graph Logic
