Výsledky vyhledávání - "Johannes Hölzl"

Akademický článek

Interactive verification of Markov chains: Two distributed protocol case studies

Publikováno v: Electronic Proceedings in Theoretical Computer Science, Vol 103, Iss Proc. QFM 2012, Pp 17-31 (2012)

Probabilistic model checkers like PRISM only check probabilistic systems of a fixed size. To guarantee the desired properties for an arbitrary size, mathematical analysis is necessary. We show for two case studies how this can be done in the interact

Externí odkaz: https://doaj.org/article/06a27452d1e2405cb0af605d7340ec72

Zobrazit plný text záznamu

Towards a beneficial management of personal health records

Autor: Christian Kop, Gerhard Leitner, Peter Schartner, Volodymyr Shekhovtsov, Claudia Steinberger, Eleni Zografou, Daniela E. Ströckl, Christoph Voutsinas, Herbert Groiss, Johannes Hölzl, Markus Irrasch

Publikováno v: Procedia Computer Science. 219:1145-1152

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::2aed529e1cd2ba90d8ffc5b3660dc492
https://doi.org/10.1016/j.procs.2023.01.395

Zobrazit plný text záznamu

Feasibility study for the use of hydrodynamic plain bearings with balancing support characteristics as main bearing in wind turbines

Autor: Tim Schröder, Amadeus Rolink, Philipp Bergmann, Johannes Hölzl, Dennis Bosse, Georg Jacobs

Publikováno v: Journal of physics / Conference series 1618: The Science of Making Torque from Wind (TORQUE 2020) 28 September – 2 October 2020, The Netherlands (online)(5) 052002 (2020). doi:10.1088/1742-6596/1618/5/052002 special issue: "Turbine technology"
Science of Making Torque from Wind, TORQUE 2020, online, 2020-09-28-2020-10-02

The Science of Making Torque from Wind, TORQUE 2020, , 28 Sep 2020 - 2 Oct 2020; Journal of physics / Conference series 1618: The Science of Making Torque from Wind (TORQUE 2020) 28 September – 2 October 2020, The Netherlands (online)(5) 052002 (20

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

Zobrazit plný text záznamu

Markov Chains and Markov Decision Processes in Isabelle/HOL

Autor: Johannes Hölzl

Publikováno v: Journal of Automated Reasoning. 59:345-387

This paper presents an extensive formalization of Markov chains (MCs) and Markov decision processes (MDPs), with discrete time and (possibly infinite) discrete state-spaces. The formalization takes a coalgebraic view on the transition systems represe

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::c5ce6e24a4cc222db5c6aea76a62cde2
https://doi.org/10.1007/s10817-016-9401-5

Zobrazit plný text záznamu

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

Autor: Simon Wimmer, Johannes Hölzl

Publikováno v: Wimmer, S & Hölzl, J 2018, MDP + TA = PTA : Probabilistic Timed Automata, Formalized (Short Paper) . in Interactive Theorem Proving-9th International Conference, ITP 2018, Held as Part of the Federated Logic Conference, FloC 2018, Proceedings . Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10895 LNCS, Springer/Verlag, pp. 597-603, 9th International Conference on Interactive Theorem Proving, ITP 2018 Held as Part of the Federated Logic Conference, FloC 2018, Oxford, United Kingdom, 9/07/18 . https://doi.org/10.1007/978-3-319-94821-8_35
Interactive Theorem Proving ISBN: 9783319948201
ITP
Interactive Theorem Proving-9th International Conference, ITP 2018, Held as Part of the Federated Logic Conference, FloC 2018, Proceedings, 597-603
STARTPAGE=597;ENDPAGE=603;TITLE=Interactive Theorem Proving-9th International Conference, ITP 2018, Held as Part of the Federated Logic Conference, FloC 2018, Proceedings

We present a formalization of probabilistic timed automata (PTA) in which we try to follow the formula “MDP + TA = PTA” as far as possible: our work starts from existing formalizations of Markov decision processes (MDP) and timed automata (TA) an

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a3f4e18ba7fe20fd57ebb1f2203a80bd
https://research.vu.nl/en/publications/4fdbd897-8519-4156-bf78-8ac2e9ac94ed

Zobrazit plný text záznamu

Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic

Autor: Fabian Meier, Andrei Popescu, Mathias Fleury, René Thiemann, Christian Sternagel, Aymeric Bouzy, Julian Biendarra, Johannes Hölzl, Dmitriy Traytel, Jasmin Christian Blanchette, Lorenz Panny, Andreas Lochbihler, Ondřej Kunčar, Martin Desharnais

Publikováno v: Frontiers of Combining Systems, 11th International Symposium
Frontiers of Combining Systems, 11th International Symposium, Sep 2017, Brasilia, Brazil. pp.3-21, ⟨10.1007/978-3-319-66167-4_1⟩
Frontiers of Combining Systems-11th International Symposium, FroCoS 2017, Proceedings, 3-21
STARTPAGE=3;ENDPAGE=21;TITLE=Frontiers of Combining Systems-11th International Symposium, FroCoS 2017, Proceedings
Biendarra, J, Blanchette, J C, Bouzy, A, Desharnais, M, Fleury, M, Hölzl, J, Kunčar, O, Lochbihler, A, Meier, F, Panny, L, Popescu, A, Sternagel, C, Thiemann, R & Traytel, D 2017, Foundational (co)datatypes and (co)recursion for higher-order logic . in C Dixon & M Finger (eds), Frontiers of Combining Systems-11th International Symposium, FroCoS 2017, Proceedings . Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10483 LNAI, Springer/Verlag, pp. 3-21, 11th International Symposium on Frontiers of Combining Systems, FroCoS 2017, Brasilia, Brazil, 27/09/17 . https://doi.org/10.1007/978-3-319-66167-4_1
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Frontiers of Combining Systems
11th International Symposium on Frontiers of Combining Systems (FroCoS 2017)
Frontiers of Combining Systems ISBN: 9783319661667
FroCoS
Frontiers of Combining Systems

International audience; We describe a line of work that started in 2011 towards enriching Isabelle/HOL's language with coinductive datatypes, which allow infinite values, and with a more expressive notion of inductive datatype than previously support

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::be47e57f3a4668a0d42d7a1834212db4
https://doi.org/10.5281/zenodo.3228084

Zobrazit plný text záznamu

Markov processes in Isabelle/HOL

Autor: Johannes Hölzl

Publikováno v: CPP

Markov processes with discrete time and arbitrary state spaces are important models in probability theory. They model the infinite steps of non-terminating programs with (not just discrete) probabilistic choice and form the basis for further probabil

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::341f4302e69ebfd0e68e88af7e315895
https://doi.org/10.1145/3018610.3018628

Zobrazit plný text záznamu

Formalising Semantics for Expected Running Time of Probabilistic Programs

Autor: Johannes Hölzl

Publikováno v: Interactive Theorem Proving ISBN: 9783319431437
ITP

We formalise two semantics observing the expected running time of pGCL programs. The first semantics is a denotational semantics providing a direct computation of the running time, similar to the weakest pre-expectation transformer. The second semant

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::883a98a51033b098221df71980eb2bce
https://doi.org/10.1007/978-3-319-43144-4_30

Zobrazit plný text záznamu

Specifying and verifying sparse matrix codes

Autor: Rastislav Bodik, Mooly Sagiv, Ali Sinan Köksal, Johannes Hölzl, Gilad Arnold

Publikováno v: ICFP

Sparse matrix formats are typically implemented with low-level imperative programs. The optimized nature of these implementations hides the structural organization of the sparse format and complicates its verification. We define a variable-free funct

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::660a57d099df959ff1a2107e4cbcdf9b
https://doi.org/10.1145/1932681.1863581

Zobrazit plný text záznamu

Simulating the photon stream of a real thermal light source

Autor: Johannes Hölzl, André Pscherer, Raimund Schneider, Christoph Biernoth, Joachim von Zanthier

Publikováno v: Applied Optics. 57:7076

We present a computer algorithm capable of simulating the photon stream and the corresponding temporal photon statistics of thermal light sources. The algorithm implements realistic experimental conditions, incorporating the relevant parameters of th

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c0d34912335a1d9471c17d421fd77852
https://doi.org/10.1364/ao.57.007076

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání