On learning assumptions for compositional verification of probabilistic systems
<p>Probabilistic model checking is a powerful formal verification method that can ensure the correctness of real-life systems that exhibit stochastic behaviour. The work presented in this thesis aims to solve the <em>scalability</em> challenge of probabilistic model checking, by de...
| প্রধান লেখক: | |
|---|---|
| অন্যান্য লেখক: | |
| বিন্যাস: | গবেষণাপত্র |
| ভাষা: | English |
| প্রকাশিত: |
2014
|
| বিষয়গুলি: |