MDP + TA = PTA: Probabilistic Timed Automata, Formalized (Short Paper)

Simon Wimmer, Johannes Hölzl. MDP + TA = PTA: Probabilistic Timed Automata, Formalized (Short Paper). In Jeremy Avigad, Assia Mahboubi, editors, Interactive Theorem Proving - 9th International Conference, ITP 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018, Proceedings. Volume 10895 of Lecture Notes in Computer Science, pages 597-603, Springer, 2018. [doi]

Abstract

Abstract is missing.