Probabilistic Model Checking and Non-standard Multi-objective Reasoning

Probabilistic model checking is a well-established method for the automated quantitative system analysis. It has been used in various application areas such as coordination algorithms for distributed systems, communication and multimedia protocols, biological systems, resilient systems or security. In this paper, we report on the experiences we made in inter-disciplinary research projects where we contribute with formal methods for the analysis of hardware and software systems. Many performance measures that have been identified as highly relevant by the respective domain experts refer to multiple objectives and require a good balance between two or more cost or reward functions, such as energy and utility. The formalization of these performance measures requires several concepts like quantiles, conditional probabilities and expectations and ratios of cost or reward functions that are not supported by state-ofthe- art probabilistic model checkers. We report on our current work in this direction, including applications in the field of software product line verification.

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

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

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

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

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

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

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

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

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

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

[11]  Paul Clements,et al.  Software product lines - practices and patterns , 2001, SEI series in software engineering.

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

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

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

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

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

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

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

[19]  R. Serfling.  Approximation Theorems of Mathematical Statistics , 1980 .

[20]  Pierre-Yves Schobbens,et al.  Featured Transition Systems: Foundations for Verifying Variability-Intensive Systems and Their Application to LTL Model Checking , 2013, IEEE Transactions on Software Engineering.

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

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

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

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

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

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

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

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

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

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

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

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

[33]  Sven Apel,et al.  The PLA model: on the combination of product-line analyses , 2013, VaMoS '13.

[34]  Jirí Srba,et al.  Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets , 2008, FORMATS.

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

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

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

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

[39]  Ajitha Rajan,et al.  Requirements Coverage as an Adequacy Measure for Conformance Testing , 2008, ICFEM.

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

[41]  Hermann Härtig,et al.  eBond: energy saving in heterogeneous R.A.I.N , 2013, e-Energy '13.

[42]  Christel Baier,et al.  Locks: Picking key methods for a scalable quantitative analysis , 2015, J. Comput. Syst. Sci..

[43]  Holger Hermanns,et al.  Discrete-time rewards model-checked (to appear) , 2003 .

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

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

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

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

[48]  C. A. Petri,et al.  Concurrency Theory , 1986, Advances in Petri Nets.