Equivalence of probabilistic \(\mu\)-calculus and p-automata
DOI10.1007/978-3-319-60134-2_6zbMath1489.68122OpenAlexW2617530626MaRDI QIDQ2399249
Publication date: 22 August 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-60134-2_6
Formal languages and automata (68Q45) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Cites Work
- Unnamed Item
- Unnamed Item
- Results on the propositional \(\mu\)-calculus
- Fixed point characterization of infinite behavior of finite-state systems
- Automata, logics, and infinite games. A guide to current research
- Probabilistic temporal logics via the modal mu-calculus
- On the equivalence of game and denotational semantics for the probabilistic mu-calculus
- Tractable Probabilistic mu-Calculus That Expresses Probabilistic Temporal Logics
- The mu-calculus and Model Checking
- Automata for the modal μ-calculus and related results
- Probabilistic modal {\mu}-calculus with independent product
- An automata-theoretic approach to branching-time model checking
- Rudiments of \(\mu\)-calculus
- Alternating tree automata, parity games, and modal \(\mu\)-calculus
This page was built for publication: Equivalence of probabilistic \(\mu\)-calculus and p-automata
