Pith. sign in

REVIEW 1 cited by

Backwards Reachability for Probabilistic Timed Automata: A Replication Report

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2208.11928 v1 pith:OGFYKDOA submitted 2022-08-25 cs.LO

Arnd Hartmanns , Bram Kohlen This is my paper · ORCID
classification cs.LO
keywords reachabilitybackwardsautomataimplementationmaximumprobabilisticprobabilitiesproperties
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Time-Sensitive Importance Splitting

    cs.LO 2025-06 conditional novelty 7.0 of 10

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

Pith tools