( en | de | ru )

 

Disambiguation of "Katoen, Joost-Pieter"

Author of the publication

copydeleteadd this publication to your clipboard
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.

Joost-Pieter Katoen

Pieter Wolter

Pieter Zwieten

Pieter Ploumen

Pieter Dingeldey

 

Other publications of authors with the same name

Various Ways to Quantify BDMPs., , , and . MARS@ETAPS, volume 316 of EPTCS, page 1-14. (2020)POMDP Controllers with Optimal Budget., , and . QEST, volume 13479 of Lecture Notes in Computer Science, page 107-130. Springer, (2022)Tweaking the Odds in Probabilistic Timed Automata., , , and . QEST, volume 12846 of Lecture Notes in Computer Science, page 39-58. Springer, (2021)Towards a Logic for Performance and Mobility., , , and . QAPL, volume 153 of Electronic Notes in Theoretical Computer Science, page 161-175. Elsevier, (2005)Latticed k-Induction with an Application to Probabilistic Programs., , , , , and . CAV (2), volume 12760 of Lecture Notes in Computer Science, page 524-549. Springer, (2021)Abstraktions-basierte Verifikation von POMDPs im Motion-Planning-Kontext., , , , , , and . MBMV, Universität Tübingen, (2018)Generative Datalog with Continuous Distributions., , , and . PODS, page 347-360. ACM, (2020)Exponentially timed SADF: Compositional semantics, reductions, and analysis., and . EMSOFT, page 1:1-1:10. ACM, (2014)Inductive Synthesis for Probabilistic Programs Reaches New Horizons., , , and . TACAS (1), volume 12651 of Lecture Notes in Computer Science, page 191-209. Springer, (2021)Simple Strategies in Multi-Objective MDPs., , , and . TACAS (1), volume 12078 of Lecture Notes in Computer Science, page 346-364. Springer, (2020)