Optimistic and pessimistic on-the-fly analysis for metric temporal graph logic
From MaRDI portal
Publication:5100739
Recommendations
Cites work
- A brief account of runtime verification
- Correctness of high-level transformation systems relative to nested conditions
- Delaying Constraint Solving in Symbolic Graph Transformation
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Formal verification of invariants for attributed graph transformation systems based on nested attributed graph conditions
- 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
- Fundamentals of algebraic graph transformation
- Lazy graph transformation
- Monitoring metric first-order temporal properties
- Probabilistic timed graph transformation systems
- Symbolic graphs for attributed graph constraints
- \(k\)-inductive invariant checking for graph transformation systems
Cited in
(6)- Bounded model checking for interval probabilistic timed graph transformation systems against properties of probabilistic metric temporal graph logic
- Metric temporal graph logic over typed attributed graphs
- Compositional analysis of probabilistic timed graph transformation systems
- Compositional analysis of probabilistic timed graph transformation systems
- Probabilistic Metric Temporal Graph Logic
- Specification and verification of a linear-time temporal logic for graph transformation
This page was built for publication: Optimistic and pessimistic on-the-fly analysis for metric temporal graph logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5100739)