Back to Results
First PageMeta Content
Probabilistic complexity theory / Complexity classes / Probabilistic Turing machine / Turing machine / PP / NL / Predicate transformer semantics / IP / Model checking / Theoretical computer science / Computational complexity theory / Applied mathematics


Generating counterexamples for quantitative safety specifications in probabilistic B Ukachukwu Ndukwu1 Department of Computing, Macquarie University, NSW 2109 Sydney, Australia. Abstract
Add to Reading List

Document Date: 2010-04-30 06:17:08


Open Document

File Size: 301,08 KB

Share Result on Facebook
UPDATE