Bisimulations Meet PCTL Equivalences for Probabilistic Automata
Probabilistic automata (PAs) have been successfully applied in formal verification of concurrent and stochastic systems. Efficient model checking algorithms have been studied, where the most often used logics for expressing properties are based on probabilistic computation tree logic (PCTL) and its...
| المؤلفون الرئيسيون: | , , , |
|---|---|
| التنسيق: | مقال |
| اللغة: | English |
| منشور في: |
Logical Methods in Computer Science e.V.
2013-06-01
|
| سلاسل: | Logical Methods in Computer Science |
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://lmcs.episciences.org/1238/pdf |