EQUIVALENCE OF LABELED MARKOV CHAINS

DOI10.1142/S0129054108005814zbMath1155.68035OpenAlexW2083770991MaRDI QIDQ3538849

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

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

Related Items (13)

Probabilistic bisimulation for realistic schedulers ⋮ On probabilistic monitorability ⋮ Probabilistic may/must testing: retaining probabilities by restricted schedulers ⋮ Lumpability abstractions of rule-based systems ⋮ Unnamed Item ⋮ Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties ⋮ Confluence reduction for Markov automata ⋮ The quest for minimal quotients for probabilistic and Markov automata ⋮ Quantitative simulations by matrices ⋮ Probabilistic Bisimulation for Realistic Schedulers ⋮ Unnamed Item ⋮ Trace Refinement in Labelled Markov Decision Processes ⋮ Unnamed Item

Cites Work

• Bisimulation through probabilistic testing
• On the definition of a family of automata
• A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
• Probabilistic automata
• Unnamed Item

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