We investigate Leifer-Milner RPO approach for CCS and πcalculus. The basic category in which we carry out the construction is the category of term contexts. Several issues and problems emerge from this experiment; for them we propose some new solutions.

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

The phases of the ANISE project (Architectural Notions In Service Engineering) are briefly explained with reference to the work reported here. An outline strategy is given for translating ANISE descriptions to LOTOS (Language of Temporal Ordering Specification), thus providing a formal basis. It is shown how modular ANISE descriptions of features can be defined and then merged. Potential featur...

In [arXiv:1006.4939] the enumeration order reducibility is defined on natural numbers. For a c.e. set A, [A] denoted the class of all subsets of natural numbers which are co-order with A. In definition 5 we redefine co-ordering for rational numbers. One of the main questions there, was:"For a specific c.e. set A, consider set of all enumerations of it which is generated by some Turing machine {...

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...