Model Checking Temporal Properties of Recursive Probabilistic Programs

Autor: Joost-Pieter Katoen, Tobias Winkler, Christina Gehnen

Publikováno v: Cham : Springer International Publishing, Lecture Notes in Computer Science 13242, 449-469 (2022). doi:10.1007/978-3-030-99253-8_23
Foundations of Software Science and Computation Structures : 25th International Conference, FOSSACS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2–7, 2022, Proceedings / edited by Patricia Bouyer, Lutz Schröder
Foundations of Software Science and Computation Structures : 25th International Conference, FOSSACS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2–7, 2022, Proceedings / edited by Patricia Bouyer, Lutz SchröderFoundations of Software Science and Computation Structures : 25. International Conference, FOSSACS 2022, Munich, Germany, 2022-04-02-2022-04-07European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, 2022-04-02-2022-04-07
Lecture Notes in Computer Science ISBN: 9783030992521

Probabilistic pushdown automata (pPDA) are a standard operational model for programming languages involving discrete random choices, procedures, and returns. Temporal properties are useful for gaining insight into the chronological order of events du

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8cc0db788560a3eba461996def92b6e9
https://publications.rwth-aachen.de/record/843600