Groundwater flow can have a significant impact on the thermal response of ground heat exchangers. The moving infinite line source model is thus widely used in practice as it considers both conductive and advective transfert processes. Solution this involves relatively heavy numerical quadrature. Contrarily to model, there currently no known first-order approximation that could be useful for man...

most of the multi-criteria decision methods (mcdm), including analytic hierarchy process (ahp) and analytic network process (anp), use subjective judgments for obtaining the relative importance of the decision elements of a subject matter. this has been considered as one the important limitations of the mcdms. the f’anp model, a hybrid factor analysis and analytic network process (f’anp) model ...

This paper presents a proof method for proving that innnite-state systems satisfy properties expressed in the modal-calculus. The method is sound and complete relative to externally proving inclusions of sets of states. It can be seen as a recast of a tableau method due to Braddeld and Stirling following lines used by Winskel for nite-state systems. Contrary to the tableau method, it avoids the...

Two well-known approaches to the veriication of reactive systems are deductive veriication and model checking. After brieey reviewing them, we present deductive model checking, which combines these two approaches. The new procedure uses deduction to extend the classical tableau-based model checking algorithms to the case of innnite-state systems.

The verification process of reactive systems in local model checking [2, 9, 28] and in explicit state model checking [14, 16] is on-the-fly. Therefore only those states of a system have to be traversed that are necessary to prove a property. In addition, if the property does not hold, than often only a small subset of the state space has to be traversed to produce a counterexample. Global model...

We describe a framework for compositional veri cation of nite state processes The framework is based on two ideas a subset of the logic CTL for which satisfaction is preserved under composition and a preorder on structures which captures the relation between a component and a system containing the component Satisfaction of a formula in the logic corresponds to being below a particular structure...

We present a terminating tableau calculus for graded hybrid logic with global modalities, reflexivity, transitivity and role hierarchies. Termination of the system is achieved through pattern-based blocking. Previous approaches to related logics all rely on chain-based blocking. Besides being conceptually simple and suitable for efficient implementation, the pattern-based approach gives us a NE...

We describe a framework for compositional verification of finite state processes. The framework is based on two ideas: a subset of the logic CTL for which satisfaction is preserved under composition; and a preorder on structures which captures the relation between a component and a system containing the component. Satisfaction of a formula in the logic corresponds to being below a particular st...

We extend the unquantiied set-theoretic fragment discussed in 1] with a restricted form of quantiication, we prove decidability of the resulting fragment by means of a tableau calculus and we address the eeciency problem of the underlying decision procedure, by showing that the model-checking steps used in 1] are not necessary.