) | ( j k Y prob pkj = = = θ The jth column of P gives the probability distribution associated with the parameter value j = θ . We consider the problem of estimatingθ , based on an observed sample of Y. The m values of θ are called the hypotheses, and finding the best value of θ is hypothesis testing. A randomized detector of θ is a random variable , with a distribution dependent on the observe...

In this paper we examine the difference between model checking high-level and low-level models. In particular, we compare the ProB model checker for the B-method and the SPIN model checker for Promela. While SPIN has a dramatically more efficient model checking engine, we show that in practice the performance can be disappointing compared to model checking high-level specifications with ProB. W...

We begin with a long code test, where our goal is that functions which pass this test with high probability are close to a linear function with small support. We do this by examining our old linearity test but add in a bit of noise, in the form a string μ. This little bit of noise will allow us to conclude that the support for the function is small and further is under the control of out and δ ...

Deg ra da tion of natu ral re sources has be come a global prob lem that threat ens the live li hood of mil lions of poor peo ple. Many prom is ing tech nolo gies for natu ral re source man age ment are avail able to ad dress these prob lems, but farm ers and oth ers of ten fail to adopt them. Why is this? Al though many fac tors can be iden ti fied, lack of se cure prop erty rights and col lec...

PROB is an animation and model checking tool, which supports integrated eventand state-based specifications combining B and CSP. We present an initial strategy for implementing the combined specification model as a concurrent Java program. Our Java implementation for the combined B and CSP model uses a similar approach to that of JCSP. The restricted operational semantics for the integrated B a...

2 Characteristic functions 2 2.1 Beta distribution: cfbeta(t, shape1, shape2, ncp = 0) . . . . . . . . . . . . . . . . . . . 2 2.2 Binomial distribution: cfbinom(t, size, prob) . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.3 Cauchy Distribution: cfcauchy(t, location = 0, scale = 1) . . . . . . . . . . . . . . . . 4 2.4 Chi-square Distribution: cfchisq(t, df, ncp = 0) . . . . . . . . . ....

Model checking of liveness properties often results in unrealistic, unfair infinite behaviors as counterexamples. Fairness is a notion where the search is constrained to infinite paths that do not ignore infinitely the execution of a set of enabled actions. In this work we present an implementation for efficient checking of LTL formulas under strong and weak fairness in ProB, available for mode...

Model checking suffers from the state space explosion problem. One method to alleviate this problem is to exploit symmetries in the system, such that duplicate symmetric components of the state space are not explored – saving time during the checking process. This paper identifies symmetries in typical structures of the formal language of B, including relations, powersets and elements of sets, ...

Continuous-time mixes represent a relatively new field in anonymity services. Their simplicity and probabilistic approach suggest promising results. In this paper their two most recent representatives, the SG Mix and the PROB Channel will be analysed. The aim of this paper is twofold: first it will be shown via analytical means that considering a locally back-tracing observer and the source-hid...

A bstract. We study cellular automata. with addi tive rules on finite undi rected graphs. The addition is carried out in some finite abelian mono id. We investigate the prob lem of deciding wheth er a given configuration has a predecessor . Depending on th e underlying monoid this prob lem is solvable in polynomial time or NP-complete. Furt hermo re, we st udy the global reversibility of cellul...