The complexity of probabilistic verification
Journal of the ACM (JACM)
Handbook of logic in computer science (vol. 3)
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Metric Analogue of Weak Bisimulation for Probabilistic Processes
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Possibilistic and Probabilistic Abstraction-Based Model Checking
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Boolean and Cartesian Abstraction for Model Checking C Programs
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
Quantitative Analysis and Model Checking
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Approximating Labeled Markov Processes
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Model checking for probability and time: from theory to practice
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Labelled Markov Processes: Stronger and Faster Approximations
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Structure-preserving binary relations for program abstraction
The essence of computation
The Existence of Finite Abstractions for Branching Time Model Checking
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Abstract interpretation of programs as Markov decision processes
SAS'03 Proceedings of the 10th international conference on Static analysis
Least Upper Bounds for Probability Measures and Their Applications to Abstractions
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Game-Based Probabilistic Predicate Abstraction in PRISM
Electronic Notes in Theoretical Computer Science (ENTCS)
Abstraction Refinement for Probabilistic Software
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Approximating Probabilistic Behaviors of Biological Systems Using Abstract Interpretation
Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
On the connections between PCTL and dynamic programming
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Bisimulation minimisation mostly speeds up probabilistic model checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Three-valued abstraction for continuous-time Markov chains
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Magnifying-lens abstraction for Markov decision processes
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Three-valued abstractions of Markov chains: completeness for a sizeable fragment of PCTL
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
A counterexample-guided abstraction-refinement framework for markov decision processes
ACM Transactions on Computational Logic (TOCL)
Modal abstractions of concurrent behavior
ACM Transactions on Computational Logic (TOCL)
Probabilistic model checking of biological systems with uncertain kinetic rates
Theoretical Computer Science
Don’t know in probabilistic systems
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
An analysis for proving probabilistic termination of biological systems
Theoretical Computer Science
Formula-free finite abstractions for linear temporal verification of stochastic hybrid systems
Proceedings of the 16th international conference on Hybrid systems: computation and control
Characterization and computation of infinite-horizon specifications over Markov processes
Theoretical Computer Science
Least upper bounds for probability measures and their applications to abstractions
Information and Computation
| Hi-index | 0.00 |
We generalize the familiar semantics for probabilistic computation tree logic from finite-state to infinite-state labelled Markov chains such that formulas are interpreted as measurable sets. Then we show how to synthesize finite-state abstractions which are sound for full probabilistic computation tree logic and in which measures are approximated by monotone set functions. This synthesis of sound finite-state approximants also applies to finite-state systems and is a probabilistic analogue of predicate abstraction. Sufficient and always realizable conditions are identified for obtaining optimal such abstractions for probabilistic propositional modal logic.