Partial order reduction for probabilistic branching time

DOI10.1016/J.ENTCS.2005.10.034MaRDI QIDQ7014293zbMATH OpenFDO

Authors Christel Baier, P. R. D'Argenio, Marcus Grösser

Publication date 11 March 2025

Full work available at URL https://doi.org/10.1016/J.ENTCS.2005.10.034

zbMATH Keywords

ample setMarkov decision processmodel checkingpartial order reductionPCTLprobabilistic visible bisimulation

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Markov and semi-Markov decision processes (90C40)

Cites work

• A logic for reasoning about time and reliability
• A stubborn attack on state explosion
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Bisimulation through probabilistic testing
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 1927573 (Why is no real title available?)
• scientific article; zbMATH DE number 794262 (Why is no real title available?)
• Model checking of probabilistic and nondeterministic systems

Cited in

(2)

• Learning algorithms for verification of Markov decision processes
• Quantitative aspects of programming languages and systems over the past 2⁴ years and beyond

This page was built for publication: Partial order reduction for probabilistic branching time

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