\(\mathrm{MDP + TA = PTA}\): probabilistic timed automata, formalized (short paper)

DOI10.1007/978-3-319-94821-8_35OpenAlexW2811334650MaRDI QIDQ1791206

Simon Wimmer, Johannes Hölzl

Publication date: 4 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-94821-8_35

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Formalization of mathematics in connection with theorem provers (68V20)

Uses Software

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: \(\mathrm{MDP + TA = PTA}\): probabilistic timed automata, formalized (short paper)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1791206)