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 extension PCTL*. Various behavioral equivalences are proposed, as a powerful tool for abstraction and compositional minimization for PAs. Unfortunately, the equivalences are well-known to be sound, but not complete with respect to the logical equivalences induced by PCTL or PCTL*. The desire of a both sound and complete behavioral equivalence has been pointed out by Segala in , but remains open throughout the years. In this paper we introduce novel notions of strong bisimulation relations, which characterize PCTL and PCTL* exactly. We extend weak bisimulations that characterize PCTL and PCTL* without next operator, respectively. Further, we also extend the framework to simulation preorders. Thus, our paper bridges the gap between logical and behavioral equivalences and preorders in this setting.
Bibliographical noteThe article is licensed under a Creative Commons license.
- Computational efficiency
- Model checking
- Fault tolerance
Song, L., Zhang, L., Godskesen, J. C., & Nielson, F. (2013). Bisimulations meet PCTL equivalences for probabilistic automata. Logical Methods in Computer Science, 9(2), . https://doi.org/10.2168/LMCS-9(2:7)2013