22 lines
1.0 KiB
Markdown
22 lines
1.0 KiB
Markdown
+++
|
|
date = 2025-06-07
|
|
draft = false
|
|
title = 'ProHVer'
|
|
subtitle = 'Quantitative Verification Tool'
|
|
links = [
|
|
{ title = "Homepage", url = "https://depend.cs.uni-saarland.de/tools/prohver/", icon = 'fa-solid fa-home' },
|
|
# { title = "Source Code", url = "https://github.com/prismmodelchecker/prism", icon = 'fa-solid fa-code' },
|
|
# { title = "Playground", url = "https://cvc5.github.io/app/", icon = 'fa-solid fa-gamepad' }
|
|
]
|
|
applications = ['Probabilistic Model Checker']
|
|
developers = ['Saarland University']
|
|
licenses = ['All Rights Reserved']
|
|
inputs = ['PRISM']
|
|
interfaces = ['CLI']
|
|
maintenance = ['Not Maintained']
|
|
# techniques = ['CDCL']
|
|
# publications = ['Kwiatkowska2011']
|
|
+++
|
|
|
|
{{<inactive year="2011">}}
|
|
ProHVer is a tool to handle systems which feature both discrete and continuous behaviour, and also involves randomness. ProHVer is capable of computing the unbounded reachability probability for a very general class of probabilistic hybrid automata. This homepage presents the tool, as well as some case studies on which it was applied. |