Probabilistic Automata and Probabilistic Logic

Abstract

AbstractWe present a monadic second-order logic which is extended by an expected value operator and show that this logic is expressively equivalent to probabilistic automata for both finite and infinite words. We give possible syntax extensions and an embedding of our probabilistic logic into weighted MSO logic. We further derive decidability results which are based on corresponding results for probabilistic automata.KeywordsProbabilistic LogicAcceptance ConditionBernoulli MeasureProbabilistic AutomatonWeighted AutomatonThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.