Symbolic dependency graphs for PCTL^>_ model-checking

DOI10.1007/978-3-319-65765-3_9zbMATH Open1494.68170OpenAlexW2740378375MaRDI QIDQ1683447FDOQ1683447

Authors: Anders Mariegaard, Kim G. Larsen 

Publication date: 1 December 2017

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

Recommendations

• Symbolic model checking for probabilistic processes
• Theoretical Aspects of Computing - ICTAC 2004
• Symbolic model checking for factored probabilistic models
• scientific article; zbMATH DE number 2080040
• Formal Modeling and Analysis of Timed Systems

zbMATH Keywords

model checkingdependency graphsprobabilistic CTL

Mathematics Subject Classification ID

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

Cited In (2)

• A distributed fixed-point algorithm for extended dependency graphs
• Elimination of detached regions in dependency graph verification

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1683447)