Model-checking continuous-time Markov chains
ACM Transactions on Computational Logic (TOCL)
Beyond Memoryless Distributions: Model Checking Semi-Markov Chains
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Model-Checking for Probabilistic Real-Time Systems (Extended Abstract)
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Model-Checking Algorithms for Continuous-Time Markov Chains
IEEE Transactions on Software Engineering
Probabilistic symbolic model checking with PRISM: a hybrid approach
International Journal on Software Tools for Technology Transfer (STTT) - Special section on tools and algorithms for the construction and analysis of systems
Verification and planning for stochastic processes with asynchronous events
Verification and planning for stochastic processes with asynchronous events
Numerical vs. statistical probabilistic model checking
International Journal on Software Tools for Technology Transfer (STTT)
Statistical probabilistic model checking with a focus on time-bounded properties
Information and Computation
A testing scenario for probabilistic processes
Journal of the ACM (JACM)
Monitoring probabilistic properties
Proceedings of the the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
On simulation-based probabilistic model checking of mixed-analog circuits
Formal Methods in System Design
Statistical model checking: an overview
RV'10 Proceedings of the First international conference on Runtime verification
| Hi-index | 0.00 |
We explore the concept of a “black-box” stochastic system, and propose an algorithm for verifying probabilistic properties of such systems based on very weak assumptions regarding system dynamics. Properties are expressed as formulae in a probabilistic temporal logic. Our presentation is a generalization of and an improvement over recent work by Sen et al. on probabilistic verification for “black-box” systems.