Affiliation:
1. Universität Bonn, Römerstr, Bonn, Germany
Abstract
Markov decision processes (MDP) can serve as operational model for probabilistic distributed systems and yield the basis for model checking algorithms against qualitative or quantitative properties. In this paper, we summarize the main steps of a quantitative analysis for a given MDP and formula of linear temporal logic, give an introduction to the modelling language ProbMela which provides a simple and intuitive way to describe complex systems with a MDP-semantics and present the basic features of the MDP model checker LiQuor.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Hardware and Architecture,Software
Reference28 articles.
1. Model checking for a probabilistic branching time logic with fairness
2. M. Berkelaar. Lp solve. www.cs.sunysb.edu/ algorith/implement/lpsolve/implement.shtml 1996.]] M. Berkelaar. Lp solve. www.cs.sunysb.edu/ algorith/implement/lpsolve/implement.shtml 1996.]]
3. Lecture Notes in Computer Science;Bianco A.,1995
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. From software verification to ‘everyware’ verification;Computer Science - Research and Development;2013-09-07
2. Constructive model-based analysis for safety assessment;International Journal on Software Tools for Technology Transfer;2012-07-06
3. Three-valued abstraction for probabilistic systems;The Journal of Logic and Algebraic Programming;2012-05
4. Probabilistic reachability for parametric Markov models;International Journal on Software Tools for Technology Transfer;2010-04-07
5. Simulation-Based CTMC Model Checking: An Empirical Evaluation;2009 Sixth International Conference on the Quantitative Evaluation of Systems;2009-09