PROB is a model checker for high-level B and Event-B models based on constraint-solving. In this paper we investigate alternate approaches for validating high-level B models using alternative techniques and tools based on using BDDs, SAT-solving and SMTsolving. In particular, we examine whether PROB can be complemented or even supplanted by using one of the tools BDDBDDB, Kodkod or SAL.

Completion-based algorithms can be employed for computing the least common subsumer of two concepts up to a given role-depth, in extensions of the lightweight DL EL. This approach has been applied also to the probabilistic DL Prob-EL, which is variant of EL with subjective probabilities. In this paper we extend the completion-based lcscomputation algorithm to nominals, yielding a procedure for ...

The motivation behind this review was to look at the impact of benefit and influence on firm worth with GCG as a directing variable exact investigations assembling organizations recorded Indonesia Stock Trade 2014-2018. Information investigation in utilized relapse decide factors engaged review. aftereffects examination are, some degree altogether affects prob. 0.0000 essentially prob level. 0....

The crossing-point forecast is defined by the intersection between a (conditional) and climate (unconditional) cumulative probability distribution function. It interpreted as prob...

ProB is a model checking tool for the B Method. In this paper we present an extension of ProB that supports checking of specifications written in a combination of CSP and B. We explain how the notations are combined semantically and give an overview of the implementation of the combination. We illustrate the benefit that appropriate use of CSP, in conjunction with our tool, gives to B developme...

A 3.6 kb DNA fragment carrying the Thermus thermophilus proBA region, which encodes the first two steps in the proline biosynthetic pathway, was cloned from the Thermus thermophilus gene library, and its complete nucleotide sequence was determined. The deduced amino acid sequence of gamma-glutamyl kinase (40,657 Da), the product of proB gene, and gamma-glutamyl phosphate reductase (48,747 Da), ...

We argue that B is a good language to conveniently express a wide range of constraint satisfaction problems. We also show that some problems can be solved quite effectively by the ProB tool. We illustrate our claim on several examples, such as the jobs puzzle for which we solve the challenge set out by Shapiro. Here we show that the B formalization is both very close to the natural language spe...

ProB is a model checker for high-level formalisms such as B, Event-B, CSP and Z. ProB uses a mixed depth-first/breadth-first search strategy, and in previous work we have argued that this can perform better in practice than pure depth-first or breadth-first search, as employed by low-level model checkers. In this paper we present a thorough empirical evaluation of this technique, which confirms...

In this paper we give an overview of some tools that we have developed to support the application of the B Method. ProB is an animation and model checking tool for the B method. ProB’s animation facilities allow users to gain confidence in their specifications. ProB contains a temporal and a state-based model checker, both of which can be used to detect various errors in B specifications. We al...

In a finite partially ordered set, Prob(x > y) denotes the proportion of linear extensions in which element x appears above element y. In 1969, S. S. Kislitsyn conjectured that in every finite poset which is not a chain, there exists a pair (x, y) for which 1/3 ≤ Prob(x > y) ≤ 2/3. In 1984, J. Kahn and M. Saks showed that there exists a pair (x, y) with 3/11 < Prob(x > y) < 8/11, but the full 1...