In this paper, we present a way of how to handle incomplete knowledge concerning moving objects. Our approach is based on the basic Qualitative Trajectory Calculus (QTCB), which is a calculus for handling interactions between moving point objects (MPO’s). Without elaborating on the domain of linguistics, we show that QTC B B is well-fitted to represent spatiotemporal natural language. Illustrat...

A brief explanation is given of the language ANISE (Architectural Notions In Service Engineering) that can be used to describe generic services as well as telecommunications services. The ANISE approach embodies a feature calculus that can be used to structure and analyse services. A description is given of the Plain Old Telephone Service using ANISE. This is extended for a number of typical fe...

We present an extension of the recursive path ordering for the purpose of showing termination of higher order rewrite systems. Keeping close to the general path ordering of Dershowitz and Hoot, we demonstrate su cient properties of the termination functions for our method to apply. Thereby we describe a class of di erent orderings. Finally we compare our method to previously published extension...

The language features and formal deenitions of the three most popular process algebras, csp, ccs and lotos, are introduced and compared.

The higher-order recursive path ordering (HORPO) defined by Jouannaud and Rubio provides a method to prove termination of higher-order rewriting. We present an iterative version of HORPO by means of an auxiliary term rewriting system, following an approach originally due to Bergstra and Klop. We study well-foundedness of the iterative definition, discuss its relationship with the original HORPO...

An ordering for terms with sequence variables and flexible arity symbols is presented. The ordering coincides with the lexicographic extension of multiset path ordering on terms without sequence variables. It is shown that the classical strict superposition calculus with ordering and equality constraints can be used as a refutationally complete proving method for well-constrained sets of clause...

Two approaches, resource-oriented and constraint-oriented, for structuring telephone systems specifications, are presented. Both approaches express behaviour by collections of communicating processes, using the language LOTOS. However, requirements are distributed differently among processes. Examples are taken from specifications of telephone systems, first basic, and then with features. The f...

Fully compositional and thermal reservoir simulation capabilities are important in oil exploration and production. There are significant resources in existing wells and in heavy oil, oil sands, and deep-water reservoirs. This article has two main goals: (1) to clearly identify chemical engineering sub-problems within reservoir simulation that the PSE community can potentially make contributions...

 Using the concept of system signature introduced by Samaniego (1985), Kochar et al. (1999) compared the lifetimes of the systems in which the lifetimes of the components are independent and identically distributed (i.i.d.) random variables. Their results are extended to the systems with exchangeable components by Navarro et al. (2005). This paper gives some alternative proofs to obtain th...