Model Checking Probabilistic Timed Automata with One or Two Clocks
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic timed automata which have one or two clocks. Firstly, we show that PCTL probabilistic model-checking problems (such as de...
| প্রধান লেখক: | , , |
|---|---|
| বিন্যাস: | প্রবন্ধ |
| ভাষা: | English |
| প্রকাশিত: |
Logical Methods in Computer Science e.V.
2008-09-01
|
| মালা: | Logical Methods in Computer Science |
| বিষয়গুলি: | |
| অনলাইন ব্যবহার করুন: | https://lmcs.episciences.org/988/pdf |