Author of the publication

Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes.

, , , and . Theor. Comput. Sci., 345 (1): 2-26 (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Out of Control: Reducing Probabilistic Models by Control-State Elimination., , and . CoRR, (2020)Abstraktions-basierte Verifikation von POMDPs im Motion-Planning-Kontext., , , , , , and . MBMV, Universität Tübingen, (2018)Automated Termination Analysis of Polynomial Probabilistic Programs., , , and . ESOP, volume 12648 of Lecture Notes in Computer Science, page 491-518. Springer, (2021)Finite-State Controllers of POMDPs using Parameter Synthesis., , , , , , and . UAI, page 519-529. AUAI Press, (2018)Exponentially timed SADF: Compositional semantics, reductions, and analysis., and . EMSOFT, page 1:1-1:10. ACM, (2014)Generative Datalog with Continuous Distributions., , , and . PODS, page 347-360. ACM, (2020)Quantitative Verification in Practice., , and . ISoLA (2), volume 6416 of Lecture Notes in Computer Science, page 127. Springer, (2010)Parametric LTL on Markov Chains., and . IFIP TCS, volume 8705 of Lecture Notes in Computer Science, page 207-221. Springer, (2014)Code Generation = A* + BURS., , , and . CC, volume 1060 of Lecture Notes in Computer Science, page 160-176. Springer, (1996)Advances in Probabilistic Model Checking.. VMCAI, volume 5944 of Lecture Notes in Computer Science, page 25. Springer, (2010)