January 01, 2020 conference-paper Open access Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities Lecture notes in computer science DOI: 10.1007/978-3-030-50086-3_9 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 0 stored of 4 References 2 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access The complexity of reachability in parametric Markov decision processes 2021 Journal of Computer and System Sciences article Computer Science Formal Methods in Verification Open access 23 citations The Complexity of Reachability in Parametric Markov Decision Processes 2020 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access 10 citations 2 results