In transition from global to modular temporal reasoning about programs
Logics and models of concurrent systems
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Compositional Methods for Probabilistic Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Counterexample-Guided Abstraction Refinement
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
An algebraic definition of simulation between programs
An algebraic definition of simulation between programs
A counterexample guided abstraction refinement framework for verifying concurrent c programs
A counterexample guided abstraction refinement framework for verifying concurrent c programs
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
Learning to divide and conquer: applying the L* algorithm to automate assume-guarantee reasoning
Formal Methods in System Design
Automated Assume-Guarantee Reasoning by Abstraction Refinement
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
A counterexample-guided abstraction-refinement framework for markov decision processes
ACM Transactions on Computational Logic (TOCL)
Automated learning of probabilistic assumptions for compositional reasoning
FASE'11/ETAPS'11 Proceedings of the 14th international conference on Fundamental approaches to software engineering: part of the joint European conferences on theory and practice of software
PRISM 4.0: verification of probabilistic real-time systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Learning-based compositional verification for synchronous probabilistic systems
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Automated assume-guarantee reasoning for simulation conformance
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Assume-Guarantee verification for probabilistic systems
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Learning Probabilistic Systems from Tree Samples
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Refinement and difference for probabilistic automata
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
High-Level counterexamples for probabilistic automata
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Compositional probabilistic verification through multi-objective model checking
Information and Computation
| Hi-index | 0.00 |
We describe an automated technique for assume-guarantee style checking of strong simulation between a system and a specification, both expressed as non-deterministic Labeled Probabilistic Transition Systems (LPTSes). We first characterize counterexamples to strong simulation as stochastic trees and show that simpler structures are insufficient. Then, we use these trees in an abstraction refinement algorithm that computes the assumptions for assume-guarantee reasoning as conservative LPTS abstractions of some of the system components. The abstractions are automatically refined based on tree counterexamples obtained from failed simulation checks with the remaining components. We have implemented the algorithms for counterexample generation and assume-guarantee abstraction refinement and report encouraging results.