On finite-state approximants for probabilistic computation tree logic

DOI10.1016/j.tcs.2005.08.008zbMath1080.68064OpenAlexW2047343396MaRDI QIDQ2576951

Michael Huth

Publication date: 29 December 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.08.008

zbMATH Keywords

optimalityMarkov chainabstractionprobabilistic model checking

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (8)

Least upper bounds for probability measures and their applications to abstractions ⋮ Characterization and computation of infinite-horizon specifications over Markov processes ⋮ Three-valued abstraction for probabilistic systems ⋮ Approximating Probabilistic Behaviors of Biological Systems Using Abstract Interpretation ⋮ Game-Based Probabilistic Predicate Abstraction in PRISM ⋮ Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations ⋮ Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates ⋮ Probabilistic model checking of biological systems with uncertain kinetic rates

Cites Work

• ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
• Semantics of probabilistic programs
• Chain-complete posets and directed sets with applications
• A logic for reasoning about time and reliability
• Bisimulation for labelled Markov processes
• Model checking hybrid logics (with an application to semistructured data)
• The complexity of probabilistic verification
• Tools and Algorithms for the Construction and Analysis of Systems
• Validation of Stochastic Systems
• CONCUR 2003 - Concurrency Theory
• CONCUR 2003 - Concurrency Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On finite-state approximants for probabilistic computation tree logic