Skip to content

Probabilistic Reasoning for Networks using PRISM and Bayonet

· 0 citations · 17 references

TL;DR

This paper compares two tools: PRISM and Bayonet, on the overall effectiveness in reasoning about such systems in networking domain and finds PRISM to be more effective than Bayonet.

View source

Similar papers

Preprint Sep 2026

Formal Reasoning about Performance Models

Discrete-event simulation is a standard technique for modelling and analysing the performance of computer systems, networks, and services. Although simulation tools are widely used, reasoning about the correctness and performance guarantees of the models they implement remains largely ad hoc: simulation outputs are int...

Moussa Labbadi, Rupak Majumdar, V. R. Sathiyanarayana et al. · 0 citations
Preprint Sep 2026

Specification-Guided Path Shortcutting for Efficient Probabilistic Model Checking

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 comp...

T. Matsumoto, Kazuki Watanabe, Masaki Waga · 0 citations
Preprint Sep 2026

Resilience in labeled real-time automata

In this paper, we characterize resilience for a labeled real-time automaton (LRTA). An LRTA is resilient if whenever a faulty event occurs, after sufficiently many events occur, the LRTA returns to normalcy and the occurrence of the faulty event is not leaked. The notion of resilience reflects the ability of an LRTA re...

Kui-Ze Zhang · 0 citations
Preprint Aug 2026

Reasoning with Probabilities: Relating Weighted Model Counting and Probabilistic Model Checking

Weighted model counting (WMC) and probabilistic model checking (PMC) are two well- established frameworks that are independently developed, the former for probabilistic inference, the latter traditionally for probabilistic verification, though recently also applied to inference. The formal relationship between the two...

Bahar Salmani, Vincent Derkinderen · 0 citations
Preprint Sep 2026

A Formal Framework for Noisy Runtime Verification

We introduce the logic EDMon---an epistemic dynamic logic meant to model monitorability concepts in noisy runtime verification. Its syntax and semantics are defined and explained and the connection between EDMon and monitorability and noisy runtime verification concepts is explored. We then demonstrate that EDMon is su...

T. M. Ferguson, S. Logan, Shawn Standefer · 0 citations
2026

Automated Discovery of Finite State Automata for the Control of Discrete Event Systems

In many industrial systems, control-related information is often opaque, undermining the ability to formally ensure safety, correctness, and performance. Representing such systems as Discrete Event Systems (DES) models enables rigorous analysis, synthesis, and correct-by-construction control, but modeling is typically...

Jhonnatan R. Semler, Rosaine F. Semler, M. Wehrmeister et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.