Fast Parametric Model Checking through Model Fragmentation
Not on the map. Why?
Abstract (arXiv)
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 parameters. In software engineering, PMC formulae can be used during design, e.g., to analyse the sensitivity of different system architectures to parametric variability, or to find optimal system configurations. They can also be used at runtime, e.g., to check if non-functional requirements are still satisfied after environmental changes, or to select new configurations after such changes. However, current PMC techniques do not scale well to systems with complex behaviour and more than a few parameters. Our paper introduces a fast PMC (fPMC) approach that overcomes this limitation, extending the applicability of PMC to a broader class of systems than previously possible. To this end, fPMC partitions the Markov models that PMC operates with into fragments whose reachability properties are analysed independently, and obtains PMC reachability formulae by combining the results of these fragment analyses. To demonstrate the effectiveness of fPMC, we show how our fPMC tool can analyse three systems (taken from the research literature, and belonging to different application domains) with which current PMC techniques and tools struggle.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 2 Feb 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 1; 2024: 0; 2025: 0; 2026: 2.
6 papers.
- 2022Abstraction-Refinement for Hierarchical Probabilistic Modelscited by 5
- 2021Fine-Tuning the Odds in Bayesian Networkscited by 3
- 2023Efficient Sensitivity Analysis for Parametric Robust Markov Chainscited by 2
- 2022Taming Reachability Analysis of DNN-Controlled Systems via Abstraction-Based Trainingcited by 0
- 2026PAC Approximation and DIRECT Optimization for Parametric Markov Modelscited by 0
- 2026Leveraging System-Level Observations to Inform Bayesian Learning of Model Parameters for Quantitative Verificationcited by 0
- 2026Leveraging System-Level Observations to Inform Bayesian Learning of Model Parameters for Quantitative Verification4 Aug 2026
- 2026PAC Approximation and DIRECT Optimization for Parametric Markov Models3 Aug 2026
- 2023Efficient Sensitivity Analysis for Parametric Robust Markov Chains1 May 2023
- 2022Taming Reachability Analysis of DNN-Controlled Systems via Abstraction-Based Training21 Nov 2022
- 2022Abstraction-Refinement for Hierarchical Probabilistic Models6 Jun 2022
- 2021Fine-Tuning the Odds in Bayesian Networks29 May 2021