Equivalence of probabilistic -calculus and p-automata

DOI10.1007/978-3-319-60134-2_6zbMATH Open1489.68122OpenAlexW2617530626MaRDI QIDQ2399249FDOQ2399249

Authors: Claudia Cauli, Nir Piterman 

Publication date: 22 August 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-60134-2_6

Recommendations

• Probabilistic Modal μ-Calculus with Independent Product
• On the equivalence of game and denotational semantics for the probabilistic \(\mu\)-calculus
• Tractable probabilistic \(\mu\)-calculus that expresses probabilistic temporal logics
• Automata for the modal \(\mu \)-calculus and related results
• Probabilistic \(\mu\)-calculus: decidability and complete axiomatization

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)

Cites Work

• Title not available (Why is that?)
• Automata, logics, and infinite games. A guide to current research
• Handbook of modal logic
• Results on the propositional \(\mu\)-calculus
• An automata-theoretic approach to branching-time model checking
• Alternating tree automata, parity games, and modal \(\mu\)-calculus
• Automata for the modal \(\mu \)-calculus and related results
• Fixed point characterization of infinite behavior of finite-state systems
• Rudiments of \(\mu\)-calculus
• On the equivalence of game and denotational semantics for the probabilistic \(\mu\)-calculus
• The mu-calculus and Model Checking
• Probabilistic modal \(\mu\)-calculus with independent product
• Probabilistic temporal logics via the modal mu-calculus
• Tractable probabilistic \(\mu\)-calculus that expresses probabilistic temporal logics

Cited In (3)

• On the equivalence of game and denotational semantics for the probabilistic \(\mu\)-calculus
• On the Complexity of the Equivalence Problem for Probabilistic Automata
• Probabilistic \(\mu\)-calculus: decidability and complete axiomatization

This page was built for publication: Equivalence of probabilistic \(\mu\)-calculus and p-automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399249)