Run-time efficient probabilistic model checking

@article{Filieri2011RuntimeEP,
  title={Run-time efficient probabilistic model checking},
  author={Antonio Filieri and Carlo Ghezzi and Giordano Tamburrelli},
  journal={2011 33rd International Conference on Software Engineering (ICSE)},
  year={2011},
  pages={341-350}
}
Unpredictable changes continuously affect software systems and may have a severe impact on their quality of service, potentially jeopardizing the system's ability to meet the desired requirements. Changes may occur in critical components of the system, clients' operational profiles, requirements, or deployment environments. The adoption of software models and model checking techniques at run time may support automatic reasoning about such changes, detect harmful configurations, and potentially… 

Figures and Tables from this paper

QoS verification and model tuning @ runtime
TLDR
The key idea to deal with verification complexity as proposed in this research consists of splitting the problem in two steps: precomputing a set of closed formulae corresponding to desired properties and depending on relevant system’s variables, and then evaluating such formulas every time a variation is detected.
Further steps towards efficient runtime verification: Handling probabilistic cost models
  • A. Filieri, C. Ghezzi
  • Computer Science
    2012 First International Workshop on Formal Methods in Software Engineering: Rigorous and Agile Approaches (FormSERA)
  • 2012
TLDR
An approach to support efficient runtime probabilistic model checking of DTMCs for properties expressed in PCTL is extended to D-MRMs and reward properties and the benefits are justified both theoretically and empirically on significant test cases.
Supporting Self-Adaptation via Quantitative Verification and Sensitivity Analysis at Run Time
TLDR
The main contribution is the description of a mathematical framework for run-time efficient probabilistic model checking, which statically generates a set of verification conditions that can be efficiently evaluated at run time as soon as changes occur.
Probabilistic Verification at Runtime for Self-Adaptive Systems
TLDR
This work states that efficient run-time model checking represents a crucial research challenge for effective and efficient self-adaptive systems design and describes several existing approaches to this problem.
MCaaS: Model Checking in the Cloud for Assurances of Adaptive Systems
TLDR
A cloud-based framework that delivers model checking as a service (MCaaS) that offloads computationally intensive model checking tasks to the cloud, thereby offering verification capabilities on demand and implementing and validate the approach for probabilistic model checking, which facilitates verifying typical properties such as reliability.
Fast Parametric Model Checking through Model Fragmentation
Parametric model checking (PMC) computes algebraic formulae that express key non-functional properties of a system (reliability, performance, etc.) as rational functions of the system and environment
Probabilistic model checking of perturbed MDPs with applications to cloud computing
TLDR
This paper presents the first approach for perturbation analysis of Markov decision processes (MDPs), a stochastic formalism that is especially popular due to the significant expressive power it provides through the combination of both probabilistic and nondeterministic choice.
Efficient Parametric Model Checking Using Domain Knowledge
TLDR
ePMC speeds up the analysis of parametric Markov chains modelling the behaviour of software by exploiting domain-specific modelling patterns for the software components, and precomputes closed-form expressions for key QoS properties of such patterns.
This is a repository copy of Efficient Parametric Model Checking Using Domain Knowledge
  • 2019
A Heuristics-Based Incremental Probabilistic Model Checking at Runtime
  • Yang Liu, Cha He
  • Computer Science
    2020 IEEE 11th International Conference on Software Engineering and Service Science (ICSESS)
  • 2020
TLDR
A heuristics-based incremental probabilistic model checking at runtime is proposed, which introduced the idea of incremental verification and developed a heuristic method to improve their performance.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 35 REFERENCES
Principles of model checking
TLDR
Principles of Model Checking offers a comprehensive introduction to model checking that is not only a text suitable for classroom use but also a valuable reference for researchers and practitioners in the field.
Principles of Model Checking (Representation and Mind Series)
TLDR
Principles of Model Checking offers a comprehensive introduction to model checking that is not only a text suitable for classroom use but also a valuable reference for researchers and practitioners in the field.
Model evolution by run-time parameter adaptation
TLDR
An approach is discussed that addresses models that deal with non-functional properties, such as reliability and performance by keeping models alive at run time and feeding a Bayesian estimator with data collected from the running system, which produces updated parameters.
PRISM: A Tool for Automatic Verification of Probabilistic Systems
TLDR
This paper presents an overview of all the main features of PRISM, a probabilistic model checking tool which has already been successfully deployed in a wide range of application domains, from real-time communication protocols to biological signalling pathways.
Model Checking
TLDR
Model checking is applied concurrently with system design, and particularly in its early stages when systems are modelled at a high level of abstraction, because the payoff of finding bugs at that stage is highest whereas the costs are low.
PRISM: Probabilistic Symbolic Model Checker
TLDR
PRISM has been successfully used to analyse probabilistic termination, performance, and quality of service properties for a range of systems, including randomized distributed algorithms, manufacturing systems and workstation clusters.
Stochastic Model Checking
TLDR
This tutorial presents an overview of model checking for both discrete and continuous-time Markov chains (DTMCs and CTMCs) by outlining the main features supported by PRISM and three real-world case studies: a probabilistic security protocol, dynamic power management and a biological pathway.
Model-based development of dynamically adaptive software
TLDR
The approach separates the adaptation behavior and non-adaptive behavior specifications of adaptive programs, making the models easier to specify and more amenable to automated analysis and visual inspection.
The Ins and Outs of the Probabilistic Model Checker MRMC
Symbolic and Parametric Model Checking of Discrete-Time Markov Chains
TLDR
A language-theoretic approach to symbolic model checking of PCTL over discrete-time Markov chains, which allows for parametric model checking by evaluating the regular expression for different parameter values, to study the influence of a lossy channel in the overall reliability of a randomized protocol.
...
1
2
3
4
...