Minimal Witnesses for Probabilistic Timed Automata

DOI10.1007/978-3-030-59152-6_28MaRDI QIDQ6485908zbMATH OpenFDO

Authors Simon Jantsch, Florian Funke, Christel Baier

Publication date 22 December 2022

Published in 1517.682 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-59152-6_28

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• Farkas certificates and minimal witnesses for probabilistic reachability constraints
• Model checking for probabilistic timed automata
• Stochastic games for verification of probabilistic timed automata
• \(\mathrm{MDP + TA = PTA}\): probabilistic timed automata, formalized (short paper)
• Symbolic model checking for probabilistic timed automata

Cited in

(5)

• Farkas certificates and minimal witnesses for probabilistic reachability constraints
• Weak bisimulation for probabilistic timed automata
• Certificates for probabilistic pushdown automata via optimistic value iteration
• Witnessing subsystems for probabilistic systems with low tree width
• From verification to causality-based explications (invited talk)

This page was built for publication: Minimal Witnesses for Probabilistic Timed Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6485908)