This short tool paper introduces MRMC, a model checker for discrete-time and continuous-time Markov reward models. It supports reward extensions of PCTL and CSL, and allows for th...
Joost-Pieter Katoen, Maneesh Khattri, Ivan S. Zapr...
Modern algorithms for the SAT problem reveal an almost tractable behavior on “real-world” instances. This is frequently contributed to the fact that these instances possess an ...
Since many applications require the verification of large sets of signatures, it is sometimes advantageous to perform a simultaneous verification instead of checking each signatu...
TV commercials recognition is a need for advertisers in order to check the ful llment of their contracts with TV stations. In this paper we present an approach to this problem base...
We introduce a temporal logic for the speci cation of real-time systems. Our logic, TPTL, employs a novel quanti er construct for referencing time: the freeze quanti er binds a var...