On the numerical verification of probabilistic rewriting systems

Authors:
Jounaidi Ben Hassen;Sofiène Tahar
Affiliations:
Concordia University, Montreal, Quebec, Canada;Concordia University, Montreal, Quebec, Canada
Venue:
Proceedings of the conference on Design, automation and test in Europe: Proceedings
Year:
2006

Citing 6
Cited 0

A logical theory of concurrent objects and its realization in the Maude language

Research directions in concurrent object-oriented programming
Model-checking continuous-time Markov chains

ACM Transactions on Computational Logic (TOCL)
Rewriting logic: roadmap and bibliography

Theoretical Computer Science - Rewriting logic and its applications
Model Checking of Probabalistic and Nondeterministic Systems

Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
PRISM 2.0: A Tool for Probabilistic Model Checking

QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
VESTA: A Statistical Model-checker and Analyzer for Probabilistic Systems

QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present in this paper a technique for the formal verification of probabilistic systems described in PMAUDE, a probabilistic extension of the rewriting system Maude. Our methodology is based on a numerical verification using the probabilistic symbolic model checking tool PRISM. In particular, we show how we can construct an abstract system from the runs of a model that preserve all the probabilistic properties of the latter. Then we deduce the probabilistic matrix that will be used for the verification in PRISM.