( en | de | ru )

 

Disambiguation of "Hartmanns, Arnd"

Author of the publication

copydeleteadd this publication to your clipboard
Backwards Reachability for Probabilistic Timed Automata: A Replication Report.

, and . CoRR, (2022)

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.

Arnd Hartmanns

Willi Hartmanns

Jörg Hartmanns

Marianne Hartmanns

Yvonne Arndt

Die Rolle von Verbänden bei der Förderung nachhaltigen Konsums und Konsequenzen für die Verbraucherpolitik. TU München, (2009)
 

Other publications of authors with the same name

Replicating sc Restart with Prolonged Retrials: An Experimental Report., and . TACAS (2), volume 12652 of Lecture Notes in Computer Science, page 373-380. Springer, (2021)Learning optimal decisions for stochastic hybrid systems., , and . MEMOCODE, page 44-55. ACM, (2021)Symblicit exploration and elimination for probabilistic model checking., and . SAC, page 1798-1806. ACM, (2021)The Modest State of Learning, Sampling, and Verifying Strategies., and . ISoLA (3), volume 13703 of Lecture Notes in Computer Science, page 406-432. Springer, (2022)Flexible support for time and costs in scenario-aware dataflow., , and . EMSOFT, page 3:1-3:10. ACM, (2016)A Modest Approach to Modelling and Checking Markov Automata., , and . QEST, volume 11785 of Lecture Notes in Computer Science, page 52-69. Springer, (2019)Classic and non-prophetic model checking for hybrid Petri nets with stochastic firings., , and . HSCC, page 10:1-10:11. ACM, (2020)Model-based testing of stochastically timed systems., , and . Innov. Syst. Softw. Eng., 15 (3-4): 207-233 (2019)Comparing Statistical and Analytical Routing Approaches for Delay-Tolerant Networks., , , and . QEST, volume 13479 of Lecture Notes in Computer Science, page 337-355. Springer, (2022)Tweaking the Odds in Probabilistic Timed Automata., , , and . QEST, volume 12846 of Lecture Notes in Computer Science, page 39-58. Springer, (2021)