Metraipolis › archive › dc_6497d9d02437

Specification-Guided Path Shortcutting for Efficient Probabilistic Model Checking — arXiv:2609.02457

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.02457
License (as archived)
CC0-1.0
Archived
2026-10-17T05:54:25.645Z
SHA-256 of the archived text
980e0f21bfbf45f088b64ec5f98bf9605d858ec898444745c5df0c7e287e90b7
Stable URL of this page
https://metraipolis.com/documento/dc_6497d9d02437

How to cite

Specification-Guided Path Shortcutting for Efficient Probabilistic Model Checking — arXiv:2609.02457 — arXiv (en), https://arxiv.org/abs/2609.02457 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6497d9d02437 (Metraipolis archive dc_6497d9d02437, sha256 980e0f21bfbf45f088b64ec5f98bf9605d858ec898444745c5df0c7e287e90b7)
BibTeX
@misc{dc6497d9d02437,
  title = {Specification-Guided Path Shortcutting for Efficient Probabilistic Model Checking — arXiv:2609.02457},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.02457},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6497d9d02437; sha256 980e0f21bfbf45f088b64ec5f98bf9605d858ec898444745c5df0c7e287e90b7},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.02457. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Given the safety-critical nature of many embedded systems, their safety assurance is essential. Because such systems are typically stochastic, probabilistic model checking is a particularly important technique. However, there is a well-known scalability issue due to state-space explosion, especially when verifying complex properties. To mitigate this issue, we propose specification-guided path shortcutting for probabilistic systems, focusing on Markov chains (MCs) and $\omega$-regular properties. The key idea is that, when the verified property is fixed, certain sequences of transitions in an MC can be replaced with a single transition without changing the satisfaction probability, and thus, we can reduce the state space of the MC. We implement the proposed path shortcutting and evaluate its contribution to the performance of probabilistic model checking, using Storm as the baseline model checker. The results suggest that our approach often outperforms the baseline, particularly on benchmark instances with complex specifications.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-03 in cs.LO).
Categorie arXiv: Logic in Computer Science (cs.LO).
Pagina del lavoro: https://arxiv.org/abs/2609.02457 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T05:49:31.369Z dalla pagina https://arxiv.org/catchup/cs.LO/2026-09-03?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).