Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Formal Methods in System Design
Termination of Probabilistic Concurrent Program
ACM Transactions on Programming Languages and Systems (TOPLAS)
Randomization Helps in LTL Model Checking
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Verifying Continuous Time Markov Chains
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Statistical probabilistic model checking with a focus on time-bounded properties
Information and Computation
On polynomial sized MDP succinct policies
Journal of Artificial Intelligence Research
Statistical Model Checking Using Perfect Simulation
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Approximate Model Checking of PCTL Involving Unbounded Path Properties
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Error control for probabilistic model checking
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
On statistical model checking of stochastic systems
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
PRISM: a tool for automatic verification of probabilistic systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
HASL: an expressive language for statistical verification of stochastic models
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
ACM Transactions on Software Engineering and Methodology (TOSEM)
| Hi-index | 0.00 |
We study the problem of statistical model checking of probabilistic systems for PCTL unbounded until property PJoinp(Æ1UÆ2) (where Join |X| {, e}) using the computation of P d 0(Æ1UÆ2). The approach is first proposed by Sen et al. in CAV'05 but their approach suffers from two drawbacks. Firstly, the computation of Pd0Æ1UÆ2) requires for its validity, a user-specified input parameter ´2 which the user is unlikely to correctly provide. Secondly, the validity of computation of Pd0Æ1UÆ2) is limited only to probabilistic models that do not contain loops. We present a new technique which addresses both problems described above. Essentially our technique transforms the hypothesis test for the unbounded until property in the original model into a new equivalent hypothesis test for bounded until property in our modified model. We empirically show the effectiveness of our technique and compare our results with those using the method proposed by Sen et al.