48 citations · 67 across the 3 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.LO2012★ 16 cited
Learning Probabilistic Systems from Tree Samples
Anvesh Komuravelli, Corina S. Pasareanu, Edmund M. Clarke
We consider the problem of learning a non-deterministic probabilistic system consistent with a given finite set of positive and negative tree samples. Consistency is defined with r…
cs.LO2012★ 48 cited
Assume-Guarantee Abstraction Refinement for Probabilistic Systems
Anvesh Komuravelli, Corina S. Pasareanu, Edmund M. Clarke
We describe an automated technique for assume-guarantee style checking of strong simulation between a system and a specification, both expressed as non-deterministic Labeled Probab…