Results 1 
3 of
3
F.: A progress measure for explicitstate probabilistic modelcheckers. Submitted to the 25th
 Annual IEEE Symposium on Logic in Computer Science. Available at www.cse.yorku.ca/~franck/research/drafts
, 2010
"... Verification of the source code of a probabilistic system by means of an explicitstate modelchecker is challenging. In most cases, the modelchecker will either run out of memory or will simply not terminate within any reasonable amount of time. We introduce the notion of a progress measure for su ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Verification of the source code of a probabilistic system by means of an explicitstate modelchecker is challenging. In most cases, the modelchecker will either run out of memory or will simply not terminate within any reasonable amount of time. We introduce the notion of a progress measure for such a modelchecker. The progress measure returns a number in the interval [0, 1]. This number provides us a quantitative measure of the amount of progress the modelchecker has made verifying a particular linear time property. The larger the number, the more progress the modelchecker has made. We also show how to compute the progress measure for checking invariants. Explicitstate modelcheckers usually exploit search strategies such as depthfirst search and breadthfirst search to explore the transitions. We introduce several new search strategies that take the probabilities associated with the transitions into account. We compare the amount of progress made by the different search strategies. 1.
On compositions and paths for coalgebras
, 2005
"... This report discusses the possibility of defining composed steps and paths in coalgebras. Both of these notions are relevant for defining some semantic relations for coalgebras like weak bisimulation and trace semantics. We present some observations, ideas, and small results on the mentioned topic ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This report discusses the possibility of defining composed steps and paths in coalgebras. Both of these notions are relevant for defining some semantic relations for coalgebras like weak bisimulation and trace semantics. We present some observations, ideas, and small results on the mentioned topics. 1
unknown title
, 2010
"... doi:10.1017/S0960129510000563 Modular algorithms for heterogeneous modal logics via multisorted coalgebra ..."
Abstract
 Add to MetaCart
doi:10.1017/S0960129510000563 Modular algorithms for heterogeneous modal logics via multisorted coalgebra