# Probabilistic Metric Temporal Graph Logic

@article{Schneider2021ProbabilisticMT, title={Probabilistic Metric Temporal Graph Logic}, author={Sven Schneider and M. Maximova and H. Giese}, journal={ArXiv}, year={2021}, volume={abs/2106.08418} }

Cyber-physical systems often encompass complex concurrent behavior with timing constraints and probabilistic failures on demand. The analysis whether such systems with probabilistic timed behavior adhere to a given specification is essential. When the states of the system can be represented by graphs, the rule-based formalism of Probabilistic Timed Graph Transformation Systems (PTGTSs) can be used to suitably capture structure dynamics as well as probabilistic and timed behavior of the system… Expand

#### References

SHOWING 1-10 OF 17 REFERENCES

Formal testing of timed graph transformation systems using metric temporal graph logic

- Computer Science
- Int. J. Softw. Tools Technol. Transf.
- 2021

Embedded real-time systems generate state sequences where time elapses between state changes. Ensuring that such systems adhere to a provided specification of admissible or desired behavior is… Expand

Probabilistic timed graph transformation systems

- Mathematics, Computer Science
- J. Log. Algebraic Methods Program.
- 2018

The formal model of PTGTSs is introduced in this paper as well as a mapping of models with finite state spaces to probabilistic timed automata (PTA) that allows to use the PRISM model checker to analyze PTG TS models with respect to PTCTL properties. Expand

Optimistic and Pessimistic On-the-fly Analysis for Metric Temporal Graph Logic

- Computer Science
- ICGT
- 2020

A further (optimistic) reduction of MTGL conditions is introduced, which leads to violations during the on-the-fly analysis of finite/infinite TGSs only when non-satisfaction is guaranteed in the future whereas the former (pessimistic) reduce leads toviolations when satisfaction is not guaranteed inThe future. Expand

Symbolic Model Checking for Probabilistic Timed Automata

- Computer Science
- FORMATS/FTRTFT
- 2004

This work presents symbolic model-checking algorithms for verifying probabilistic timed automata against properties of PTCTL (Probabilistic Timed Computation Tree Logic), and reports on a prototype implementation of the algorithms using Difference Bound Matrices. Expand

Probabilistic Graph Transformation Systems

- Computer Science
- ICGT
- 2012

This paper defines the semantics of PGTSs in terms of Markov decision processes and employ probabilistic model checking for the quantitative analysis of finite-state PGTS models and presents tool support using Henshin and Prism. Expand

Monitoring Metric First-Order Temporal Properties

- Computer Science
- J. ACM
- 2015

The results show that metric first-order temporal logic can serve as an effective specification language for expressing and monitoring a wide variety of practically relevant system properties. Expand

Metric Temporal Graph Logic over Typed Attributed Graphs

- Computer Science
- FASE
- 2019

This work considers the case where time may elapse between state changes and introduces a logic, called Metric Temporal Graph Logic (MTGL), to reason about such timed graph sequences. Expand

Rule-based runtime verification revisited

- Computer Science
- International Journal on Software Tools for Technology Transfer
- 2014

This work has implemented a rule-based system, named LogFire, for runtime verification, founded on the Rete algorithm, as an internal DSL in the Scala programming language (in essence a library), which allows to write rules elegantly as part of Scala programs. Expand

PRISM 4.0: Verification of Probabilistic Real-Time Systems

- Computer Science
- CAV
- 2011

A major new release of the PRISMprobabilistic model checker is described, adding, in particular, quantitative verification of (priced) probabilistic timed automata. Expand

Bounded Model Checking for Probabilistic Programs

- Computer Science
- ATVA
- 2016

This paper proposes an on–the–fly approach where the operational model is successively created and verified via a step–wise execution of the program, enabling to take key features of many probabilistic programs into account: nondeterminism and conditioning. Expand