activity
20172020
most citedAnalyzing Deep Neural Networks with Symbolic Propagation: Towards Higher Precision and Faster Verification

55 citations · 60 across the 3 of their papers we have counts for

collaborators
Showing 2017Show all

1 paper · 1 filter

cs.FL2017★ 1 cited

Verifying Probabilistic Timed Automata Against Omega-Regular Dense-Time Properties

Hongfei Fu, Yi Li, Jianlin Li +1

Probabilistic timed automata (PTAs) are timed automata (TAs) extended with discrete probability distributions.They serve as a mathematical model for a wide range of applications th…