Probabilistic Logical Characterization
In Information and Computation
, 209: 154-172, 2011.
Downloads: pdf, bibURL: http://dx.doi.org/10.1016/j.ic.2010.11.024
Abstract. Probabilistic automata exhibit both probabilistic and non-deterministic choice. They are therefore a powerful semantic foundation for modeling concurrent systems with random phenomena arising in many applications ranging from artificial intelligence, security, systems biology to performance modeling. Several variations of bisimulation and simulation relations have proved to be useful as means to abstract and compare different automata. This paper develops a taxonomy of logical characterizations of these relations on image-finite and image-infinite probabilistic automata.