Three-Valued Abstractions of Markov Chains: Completeness for a Sizeable Fragment of PCTL

DOI10.1007/978-3-642-03409-1_19zbMath1252.03037OpenAlexW1581789658MaRDI QIDQ3183611

Michael Huth, Daniel Wagner, Nir Piterman

Publication date: 20 October 2009

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03409-1_19

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Temporal logic (03B44) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

Characterization and computation of infinite-horizon specifications over Markov processes ⋮ Three-valued abstraction for probabilistic systems

This page was built for publication: Three-Valued Abstractions of Markov Chains: Completeness for a Sizeable Fragment of PCTL