English

Robust Probabilistic Temporal Logics

Logic in Computer Science 2024-08-06 v3 Formal Languages and Automata Theory

Abstract

We robustify PCTL and PCTL*, the most important specification languages for probabilistic systems, and show that robustness does not increase the complexity of their model-checking problems.

Keywords

Cite

@article{arxiv.2306.05806,
  title  = {Robust Probabilistic Temporal Logics},
  author = {Martin Zimmermann},
  journal= {arXiv preprint arXiv:2306.05806},
  year   = {2024}
}