Robust probabilistic temporal logics

Martin Zimmermann

doi:10.1016/j.ipl.2024.106522

Robust probabilistic temporal logics

Martin Zimmermann

Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › peer review

7 Downloads (Pure)

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.

Originalsprog	Engelsk
Artikelnummer	106522
Tidsskrift	Information Processing Letters
Vol/bind	188
ISSN	0020-0190
DOI	https://doi.org/10.1016/j.ipl.2024.106522
Status	Udgivet - feb. 2025

Bibliografisk note

Publisher Copyright:
© 2024 The Author(s)

Adgang til dokumentet

10.1016/j.ipl.2024.106522

Open Access articleForlagets udgivne version, 509 KBLicens: CC BY 4.0

AUB Link

Søg efter materialet i Aalborg Universitetsbiblioteks søgemaskine

Andre filer og links

Link to publication in Scopus

Citationsformater

@article{02be171b3a23481780ef564e0dda2923,

title = "Robust probabilistic temporal logics",

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 = "Model-checking, Probabilistic temporal logics, Robustness",

author = "Martin Zimmermann",

note = "Publisher Copyright: {\textcopyright} 2024 The Author(s)",

year = "2025",

month = feb,

doi = "10.1016/j.ipl.2024.106522",

language = "English",

volume = "188",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

}

TY - JOUR

T1 - Robust probabilistic temporal logics

AU - Zimmermann, Martin

PY - 2025/2

Y1 - 2025/2

N2 - 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.

AB - 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.

KW - Model-checking

KW - Probabilistic temporal logics

KW - Robustness

UR - http://www.scopus.com/inward/record.url?scp=85200809171&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2024.106522

DO - 10.1016/j.ipl.2024.106522

M3 - Journal article

AN - SCOPUS:85200809171

SN - 0020-0190

VL - 188

JO - Information Processing Letters

JF - Information Processing Letters

M1 - 106522

ER -

Robust probabilistic temporal logics

Abstract

Bibliografisk note

Adgang til dokumentet

AUB Link

Andre filer og links

Fingeraftryk

Citationsformater