1 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.PL2020★ 1 cited
Inductive Reachability Witnesses
Ali Asadi, Krishnendu Chatterjee, Hongfei Fu +2
In this work, we consider the fundamental problem of reachability analysis over imperative programs with real variables. The reachability property requires that a program can reach…
cs.DS2020★ 1 cited
Faster Algorithms for Quantitative Analysis of Markov Chains and Markov Decision Processes with Small Treewidth
Ali Asadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady +2
Discrete-time Markov Chains (MCs) and Markov Decision Processes (MDPs) are two standard formalisms in system analysis. Their main associated quantitative objectives are hitting pro…