Trade-off analysis meets probabilistic model checking

Probabilistic model checking (PMC) is a well-established and powerful method for the automated quantitative analysis of parallel distributed systems. Classical PMC-approaches focus on computing probabilities and expectations in Markovian models annotated with numerical values for costs and utility, such as energy and performance. Usually, the utility gained and the costs invested are dependent and a trade-off analysis is of utter interest. In this paper, we provide an overview on various kinds of non-standard multi-objective formalisms that enable to specify and reason about the trade-off between costs and utility. In particular, we present the concepts of quantiles, conditional probabilities and expectations as well as objectives on the ratio between accumulated costs and utility. Such multi-objective properties have drawn very few attention in the context of PMC and hence, there is hardly any tool support in state-of-the-art model checkers. Furthermore, we broaden our results towards combined quantile queries, computing conditional probabilities those conditions are expressed as formulas in probabilistic computation tree logic, and the computation of ratios which can be expected on the long-run.

[1]  Luca de Alfaro,et al.  Computing Minimum and Maximum Reachability Times in Probabilistic Systems , 1999, CONCUR.

[2]  Mihalis Yannakakis,et al.  The complexity of probabilistic verification , 1995, JACM.

[3]  Kim G. Larsen,et al.  Optimal Bounds for Multiweighted and Parametrised Energy Games , 2013, Theories of Programming and Formal Methods.

[4]  Krishnendu Chatterjee,et al.  Temporal Specifications with Accumulative Values , 2011, LICS.

[5]  Thomas A. Henzinger,et al.  Markov Decision Processes with Multiple Objectives , 2006, STACS.

[6]  Christel Baier,et al.  Energy-Utility Quantiles , 2014, NASA Formal Methods.

[7]  Krishnendu Chatterjee,et al.  Energy Parity Games , 2010, ICALP.

[8]  Joost-Pieter Katoen,et al.  Discrete-Time Rewards Model-Checked , 2003, FORMATS.

[9]  Thomas Wilke,et al.  Automata logics, and infinite games: a guide to current research , 2002 .

[10]  Hugo Gimbert,et al.  Pure Stationary Optimal Strategies in Markov Decision Processes , 2007, STACS.

[11]  K. Nair,et al.  Markov ratio decision processes , 1977 .

[12]  Christian von Essen,et al.  Synthesizing Systems with Optimal Average-Case Behavior for Ratio Objectives , 2011, iWIGP.

[13]  Christel Baier,et al.  Principles of model checking , 2008 .

[14]  Marta Z. Kwiatkowska,et al.  Automated Verification Techniques for Probabilistic Systems , 2011, SFM.

[15]  Christel Baier,et al.  Probabilistic Model Checking for Energy-Utility Analysis , 2014, Horizons of the Mind.

[16]  Andrew Hinton,et al.  PRISM: A Tool for Automatic Verification of Probabilistic Systems , 2006, TACAS.

[17]  Christel Baier,et al.  Principles of Model Checking (Representation and Mind Series) , 2008 .

[18]  Christel Baier,et al.  Model checking for a probabilistic branching time logic with fairness , 1998, Distributed Computing.

[19]  Lijun Zhang,et al.  Model checking conditional CSL for continuous-time Markov chains , 2013, Inf. Process. Lett..

[20]  Christel Baier,et al.  Computing Quantiles in Markov Reward Models , 2013, FoSSaCS.

[21]  Joost-Pieter Katoen,et al.  The Ins and Outs of the Probabilistic Model Checker MRMC , 2009, 2009 Sixth International Conference on the Quantitative Evaluation of Systems.

[22]  Luca de Alfaro,et al.  How to Specify and Verify the Long-Run Average Behavior of Probabilistic Systems , 1998, LICS.

[23]  Krishnendu Chatterjee,et al.  Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification , 2011, SODA '11.

[24]  Christel Baier,et al.  Computing Conditional Probabilities in Markovian Models Efficiently , 2014, TACAS.

[25]  Peter van Rossum,et al.  Conditional Probabilities over Probabilistic and Nondeterministic Systems , 2008, TACAS.

[26]  Stephan Merz,et al.  Model Checking , 2000 .

[27]  Christel Baier,et al.  Probabilistic model checking for energy analysis in software product lines , 2013, MODULARITY.

[28]  Parosh Aziz Abdulla,et al.  Solving Parity Games on Integer Vectors , 2013, CONCUR.

[29]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[30]  Zohar Manna,et al.  Formal verification of probabilistic systems , 1997 .

[31]  Christel Baier,et al.  Energy-Utility Analysis for Resilient Systems Using Probabilistic Model Checking , 2014, Petri Nets.

[32]  J. Ben Atkinson,et al.  Modeling and Analysis of Stochastic Systems , 1996 .

[33]  Moshe Y. Vardi.  Automatic verification of probabilistic concurrent finite state programs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[34]  Christel Baier,et al.  Weight monitoring with linear temporal logic: complexity and decidability , 2014, CSL-LICS.

[35]  Ing Rj Ser.  Approximation Theorems of Mathematical Statistics , 1980 .

[36]  Di Wu,et al.  Verification Method of Conditional Probability Based on Automaton , 2013, J. Networks.

[37]  Bengt Jonsson,et al.  A logic for reasoning about time and reliability , 1990, Formal Aspects of Computing.

[38]  Andrea Bianco,et al.  Model Checking of Probabalistic and Nondeterministic Systems , 1995, FSTTCS.

[39]  Krishnendu Chatterjee,et al.  Energy and Mean-Payoff Parity Markov Decision Processes , 2011, MFCS.

[40]  Takashi Tomita,et al.  A Temporal Logic with Mean-Payoff Constraints , 2012, ICFEM.

[41]  Tomás Brázdil,et al.  On the Decidability of Temporal Properties of Probabilistic Pushdown Automata , 2005, STACS.

[42]  Kim G. Larsen,et al.  A Logic for Accumulated-Weight Reasoning on Multiweighted Modal Automata , 2012, 2012 Sixth International Symposium on Theoretical Aspects of Software Engineering.

[43]  Kousha Etessami,et al.  Multi-Objective Model Checking of Markov Decision Processes , 2007, Log. Methods Comput. Sci..