Symbolic dependency graphs for \(\mathrm {PCTL}^{>}_{\leq}\) model-checking

DOI10.1007/978-3-319-65765-3_9zbMath1494.68170OpenAlexW2740378375MaRDI QIDQ1683447

Anders Mariegaard, Kim Guldstrand Larsen

Publication date: 1 December 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-65765-3_9

zbMATH Keywords

model checkingdependency graphsprobabilistic CTL

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

Elimination of detached regions in dependency graph verification

This page was built for publication: Symbolic dependency graphs for \(\mathrm {PCTL}^{>}_{\leq}\) model-checking