By incorporating timer bounds into a backwards reachability-based importance function, the paper gives a rare event simulation method that estimates a PAND-gate failure probability where the time-agnostic baseline finds no rare event.
Backwards Reachability for Probabilistic Timed Automata: A Replication Report
1 Pith paper cite this work, alongside 1 external citations. Polarity classification is still indexing.
1
Pith paper citing it
1
external citations · Pith
abstract
Backwards reachability is an efficient zone-based approach for model checking probabilistic timed automata w.r.t. PTCTL properties. Current implementations, however, are restricted to maximum probabilities of reachability properties. In this paper, we report on our new implementation of backwards reachability as part of the Modest Toolset. Its support for minimum and maximum probabilities of until formulas makes it the most general implementation available today. We compare its behaviour to the experimental results reported in the original papers presenting the backwards reachability technique.
fields
cs.LO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Time-Sensitive Importance Splitting
By incorporating timer bounds into a backwards reachability-based importance function, the paper gives a rare event simulation method that estimates a PAND-gate failure probability where the time-agnostic baseline finds no rare event.