A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Equivalence of Probabilistic $$\mu $$ -Calculus and p-Automata
[chapter]
2017
Lecture Notes in Computer Science
An important characteristic of Kozen's µ-calculus is its strong connection with parity alternating tree automata. Here, we show that the probabilistic µ-calculus µ p -calculus and p-automata (parity alternating Markov chain automata) have an equally strong connection. Namely, for every µ p -calculus formula we can construct a p-automaton that accepts exactly those Markov chains that satisfy the formula. For every p-automaton we can construct a µ p -calculus formula satisfied in exactly those
doi:10.1007/978-3-319-60134-2_6
fatcat:4wp4flajcnhq7ohyy7ywdq3qxa