Close #62

tools/prob/infamy.md

@@ -0,0 +1,22 @@
++++
+date = 2025-06-07
+draft = false
+title = ' INFAMY'
+subtitle = 'Quantitative Verification Tool'
+links = [
+    { title = "Homepage", url = "https://depend.cs.uni-saarland.de/tools/infamy/", 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 Checking']
+developers = ['Saarland University']
+licenses = ['All Rights Reserved']
+inputs = ['PRISM']
+interfaces = ['CLI']
+maintenance = ['Not Maintained']
+# techniques = ['CDCL']
+# publications = ['Kwiatkowska2011']
++++
+
+{{<inactive year="2010">}}
+INFAMY is a tool with the purpose of model checking CSL formulae on infinite state Markov chains in continuous time.

tools/prob/param.md

@@ -0,0 +1,22 @@
++++
+date = 2025-06-07
+draft = false
+title = ' PARAM'
+subtitle = 'Quantitative Verification Tool'
+links = [
+    { title = "Homepage", url = "https://depend.cs.uni-saarland.de/tools/param/", 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 Checking']
+developers = ['Saarland University']
+licenses = ['All Rights Reserved']
+inputs = ['PRISM']
+interfaces = ['CLI']
+maintenance = ['Not Maintained']
+# techniques = ['CDCL']
+# publications = ['Kwiatkowska2011']
++++
+
+{{<inactive year="2011">}}
+PARAM is a tool with the purpose of handling parametric variants of models specified in a variant of the PRISM language. PARAM is capable of computing the unbounded reachability probability for parametric discrete-time Markov chains. 

tools/prob/pass.md

@@ -0,0 +1,22 @@
++++
+date = 2025-06-07
+draft = false
+title = ' PASS'
+subtitle = 'Quantitative Verification Tool'
+links = [
+    { title = "Homepage", url = "https://depend.cs.uni-saarland.de/tools/pass/", 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 Abstraction']
+developers = ['Saarland University']
+licenses = ['All Rights Reserved']
+inputs = ['PRISM']
+interfaces = ['CLI']
+maintenance = ['Not Maintained']
+# techniques = ['CDCL']
+# publications = ['Kwiatkowska2011']
++++
+
+{{<inactive year="2010">}}
+PASS is an analysis tool for infinite-state probabilistic models. It is based on predicate abstraction and automatic abstraction refinement. Models are specified in a variant of the PRISM language. PASS computes the probability of reaching a set of goal states specified by the user.

tools/prob/prohver.md

@@ -0,0 +1,22 @@
++++
+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 Checking']
+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.