In the research field of process calculi, encoding between different calculi is an effective way to compare the expressive power of them and can shed light on the essence of where the difference lies. Thomsen and Sangiorgi have worked on the higher-order calculi (higher-order CCS and higherorder pi-calculus, respectively) and the encoding to and from first-order pi-calculus. But the work is not...

We demonstrate a general framework for extending the picalculus with data terms. In this we generalise and improve on several related efforts such as the spi calculus and the applied pi-calculus, also including pattern matching and polyadic channels. Our framework uses a single untyped notion of agent, name and scope, an operational semantics without structural equivalence and a simple definiti...

Process algebras such as CSP or the Pi-calculus are theories to reason about concurrent software. The Pi-calculus also introduces channel passing to address specific issues in mobility. Despite their similarity, the languages expose salient divergences at the formal level. CSP is built upon trace semantics while labeled transition systems and bisimulation are the privileged tools to discuss the...

The paper investigates a concurrent computation model, chi calculus, in which communications resemble cut eliminations for classical proofs. Two bisimilarities, local bisimilarity and barbed bisimilarity, on chi processes are studied and are shown to be congruence relations. The former equivalence turns out to be strictly stronger than the latter. It is shown that chi calculus is capable of mod...

This paper is a contribution to the search for efficient and high-level mathematical tools specify reason about (abstract) programming languages or calculi. Generalising reduction monads of Ahrens et al., we introduce transition monads, thus covering new applications such as lambda-bar-mu-calculus, pi-calculus, Positive GSOS specifications, differential lambda-calculus, big-step, simply-typed, ...

We investigate the problem of deciding first-order theories of finite trees with several distinguished congruence relations, each of them given by some equational axioms. We give an automata-based solution for the case where the different equational axiom systems are linear and variable-disjoint (this includes the case where all axioms are ground), and where the logic does not permit to express...

However, this problem can be fixed by requiring active substitutions be defined on the base sort only (see, for instance, [3]). The purpose of this note is to supply a proof for the theorem. In the original semantics in [1], the use of structural equivalence introduces many possibilities and makes it difficult to write a rigorous proof. To overcome the difficulty we shall use intermediate seman...