Fast randomized consensus using shared memory
Journal of Algorithms
Markov decision processes and regular events
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time 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
A Compositional Trace-Based Semantics for Probabilistic Automata
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
Distributed Computing
Performance analysis of probabilistic timed automata using digital clocks
Formal Methods in System Design
LiQuor: A tool for Qualitative and Quantitative Linear Time analysis of Reactive Systems
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Compositional Quantitative Reasoning
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Observing Branching Structure through Probabilistic Contexts
SIAM Journal on Computing
Learning to divide and conquer: applying the L* algorithm to automate assume-guarantee reasoning
Formal Methods in System Design
Probabilistic environments in the quantitative analysis of (non-probabilistic) behaviour models
Proceedings of the the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Multi-objective model checking of Markov decision processes
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Switched probabilistic i/o automata
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
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
From ZULU to RERS: lessons learned in the ZULU challenge
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Dependability analysis and verification for CONNECTed systems
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II
Quantitative multi-objective verification for probabilistic systems
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
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
Stochastic differential dynamic logic for stochastic hybrid programs
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Learning-based compositional verification for synchronous probabilistic systems
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Learning Probabilistic Systems from Tree Samples
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Assume-guarantee abstraction refinement for probabilistic systems
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Probabilistic contracts for component-based design
Formal Methods in System Design
Pareto curves for probabilistic model checking
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Compositional reverification of probabilistic safety properties for large-scale complex IT systems
Proceedings of the 17th Monterey conference on Large-Scale Complex IT Systems: development, operation and management
Evolution, adaptation, and the quest for incrementality
Proceedings of the 17th Monterey conference on Large-Scale Complex IT Systems: development, operation and management
A proof system for compositional verification of probabilistic concurrent processes
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
An incremental verification framework for component-based software systems
Proceedings of the 16th International ACM Sigsoft symposium on Component-based software engineering
Refinement and difference for probabilistic automata
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
From software verification to `everyware' verification
Computer Science - Research and Development
Compositional probabilistic verification through multi-objective model checking
Information and Computation
Adaptive model learning for continual verification of non-functional properties
Proceedings of the 5th ACM/SPEC international conference on Performance engineering
| Hi-index | 0.00 |
We present a compositional verification technique for systems that exhibit both probabilistic and nondeterministic behaviour. We adopt an assume-guarantee approach to verification, where both the assumptions made about system components and the guarantees that they provide are regular safety properties, represented by finite automata. Unlike previous proposals for assume-guarantee reasoning about probabilistic systems, our approach does not require that components interact in a fully synchronous fashion. In addition, the compositional verification method is efficient and fully automated, based on a reduction to the problem of multi-objective probabilistic model checking. We present asymmetric and circular assume-guarantee rules, and show how they can be adapted to form quantitative queries, yielding lower and upper bounds on the actual probabilities that a property is satisfied. Our techniques have been implemented and applied to several large case studies, including instances where conventional probabilistic verification is infeasible.