Probabilistic Model Checking for Energy-Utility Analysis

In the context of a multi-disciplinary project, where we contribute with formal methods for reasoning about energy-awareness and other quantitative aspects of low-level resource management protocols, we made a series of interesting observations on the strengths and limitations of probabilistic model checking. To our surprise, the operating-system experts identified several relevant quantitative measures that are not supported by state-of-the-art probabilistic model checkers. Most notably are conditional probabilities and quantiles. Both are standard in mathematics and statistics, but research on them in the context of probabilistic model checking is rare. Another deficit of standard probabilistic model-checking techniques was the lack of methods for establishing properties imposing constraints on the energy-utility ratio.

[1]  Piotr Sankowski,et al.  Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings , 2011, MFCS.

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

[3]  Kousha Etessami,et al.  Approximating the termination value of one-counter MDPs and stochastic games , 2013, Inf. Comput..

[4]  Christian von Essen,et al.  Synthesizing Efficient Controllers , 2012, VMCAI.

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

[6]  Lubos Brim,et al.  ProbDiVinE-MC: Multi-core LTL Model Checker for Probabilistic Systems , 2008, 2008 Fifth International Conference on Quantitative Evaluation of Systems.

[7]  Radu Mateescu,et al.  CADP 2011: a toolbox for the construction and analysis of distributed processes , 2012, International Journal on Software Tools for Technology Transfer.

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

[9]  Kim G. Larsen,et al.  Memory Efficient Data Structures for Explicit Verification of Timed Systems , 2014, NASA Formal Methods.

[10]  V. Kulkarni.  Modeling and Analysis of Stochastic Systems , 1996 .

[11]  Prakash Panangaden,et al.  Measure and probability for concurrency theorists , 2001, Theor. Comput. Sci..

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

[13]  Thomas Wilke,et al.  Automata Logics, and Infinite Games , 2002, Lecture Notes in Computer Science.

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

[15]  Boudewijn R. Haverkort,et al.  Performance of computer communication systems - a model-based approach , 1998 .

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

[17]  Patrice Perny,et al.  On Finding Compromise Solutions in Multiobjective Markov Decision Processes , 2010, ECAI.

[18]  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.

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

[20]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[21]  Marta Z. Kwiatkowska,et al.  Probabilistic symbolic model checking with PRISM: a hybrid approach , 2004, International Journal on Software Tools for Technology Transfer.

[22]  Joost-Pieter Katoen,et al.  Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

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

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

[25]  Prakash Panangaden,et al.  Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes , 2003, J. Log. Algebraic Methods Program..

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

[27]  Kousha Etessami,et al.  Upper Bounds for Newton’s Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata , 2013, J. ACM.

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

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

[30]  Joost-Pieter Katoen,et al.  Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[31]  Christel Baier,et al.  Waiting for Locks: How Long Does It Usually Take? , 2012, FMICS.

[32]  Christel Baier,et al.  Performability assessment by model checking of Markov reward models , 2010, Formal Methods Syst. Des..

[33]  Krishnendu Chatterjee,et al.  Energy parity games☆ , 2012, Theoretical Computer Science.

[34]  Miguel E. Andrés,et al.  Quantitative Analysis of Information Leakage in Probabilistic and Nondeterministic Systems , 2011, ArXiv.

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

[36]  Jeremy Sproston,et al.  Model Checking Durational Probabilistic Systems , 2005, FoSSaCS.

[37]  Christel Baier,et al.  A Probabilistic Quantitative Analysis of Probabilistic-Write/Copy-Select , 2013, NASA Formal Methods.

[38]  Hongyang Qu,et al.  Quantitative Multi-objective Verification for Probabilistic Systems , 2011, TACAS.

[39]  Christel Baier,et al.  Chiefly Symmetric: Results on the Scalability of Probabilistic Model Checking for Operating-System Code , 2012, SSV.

[40]  Y. Oualhadj.  The value problem in stochastic games , 2012 .

[41]  Kousha Etessami,et al.  Analysis of Recursive Game Graphs Using Data Flow Equations , 2004, VMCAI.

[42]  Robin Milner,et al.  Theories for the Global Ubiquitous Computer , 2004, FoSSaCS.

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

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

[45]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[46]  Ian Stark,et al.  Free-Algebra Models for the pi-Calculus , 2005, FoSSaCS.

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

[48]  Kousha Etessami,et al.  One-Counter Stochastic Games , 2010, FSTTCS.

[49]  Ian Stark,et al.  Randomised Testing of a Microprocessor Model Using SMT-Solver State Generation , 2014, FMICS.

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