The success of probabilistic model checking for discrete-time Markov decision processes and continuous-time Markov chains has led to rich academic and industrial applications. The ...
1 This papers introduces a generic framework for OBDD variants with weighted edges. It covers many boolean and multi-valued OBDD-variants that have been studied in the literature a...
Structured QBDs by Abstraction Daniel Klink, Anne Remke, Boudewijn R. Haverkort, Fellow, IEEE, and Joost-Pieter Katoen, Member, IEEE Computer Society —This paper studies quantita...
Daniel Klink, Anne Remke, Boudewijn R. Haverkort, ...
We study the problem of searching on encrypted data, where the search is performed using a plaintext message or a keyword, rather than a message-specific trapdoor as done by state...
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...