EQUIVALENCE OF LABELED MARKOV CHAINS

DOI10.1142/S0129054108005814MaRDI QIDQ3538849zbMATH OpenOpenAlexFDO

Authors Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin

Publication date 24 November 2008

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054108005814

zbMATH Keywords

bisimulation for probabilistic automataLabeled Markov Decision Processesweighted probabilistic automata

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Formal languages and automata (68Q45) Markov and semi-Markov decision processes (90C40)

Recommendations

• scientific article; zbMATH DE number 149518
• On the total variation distance of labelled Markov chains
• Approximate equivalence of Markov decision processes.
• scientific article; zbMATH DE number 1361128
• A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata

Cites work

• A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
• Bisimulation through probabilistic testing
• scientific article; zbMATH DE number 3641626 (Why is no real title available?)
• On the definition of a family of automata
• Probabilistic automata

Cited in

(18)

• Equivalence criterion for the global and detailed balance equations of Markov chains
• Probabilistic bisimulation for realistic schedulers
• The quest for minimal quotients for probabilistic and Markov automata
• Probabilistic may/must testing: retaining probabilities by restricted schedulers
• Lumpability abstractions of rule-based systems
• On the total variation distance of labelled Markov chains
• Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties
• Confluence reduction for Markov automata
• scientific article; zbMATH DE number 7204940 (Why is no real title available?)
• Distribution bisimilarity via the power of convex algebras
• Probabilistic bisimulation for realistic schedulers
• Approximate equivalence of Markov decision processes.
• Graded monads and graded logics for the linear time -- branching time spectrum
• On probabilistic monitorability
• Comparing labelled Markov decision processes
• Minimising the probabilistic bisimilarity distance
• Regular games with imperfect information are not that regular
• Quantitative simulations by matrices

This page was built for publication: EQUIVALENCE OF LABELED MARKOV CHAINS

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