Robust Probabilistic Temporal Logics
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910553263308800 |
|---|---|
| author | Zimmermann, Martin |
| author_facet | Zimmermann, Martin |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2306_05806 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Robust Probabilistic Temporal Logics Zimmermann, Martin Logic in Computer Science Formal Languages and Automata Theory 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. |
| title | Robust Probabilistic Temporal Logics |
| topic | Logic in Computer Science Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2306.05806 |