The paper investigates the non-symbolic algebraic semantics of the weak bisimulation congruenceson finite pi processes. The weak bisimulation congruences are studied both in the absence and inthe presence of the mismatch operator. Some interesting phenomena about the open congruences arerevealed. Several new tau laws are discovered and their relationship is discussed. The contributi...

In this work, we incorporate reversibility into structured communication-based programming, to allow parties of a session to automatically undo, ina rollback fashion, the effect of previously executed interactions. This per-mits to take different computation paths along the same session, as wellas to revert the whole session and starting a new one. Our aim is to de-fine a th...

In this paper we propose a stochastic broadcast π-calculus which can be used to model server-client based systems where synchronization is always governed by only one participant. Therefore, there is no need to determine the joint synchronization rates. We also take immediate transitions into account which is useful to model behaviors with no impact on the temporal properties of a system. Since...

With the publishing and creation of the Web Services Description Language (WS-CDL) and the success of the Pi Calculus it has been stated that the former is based on the latter. A well reasoned answer for or against this claim is not to be found. Here an approach to a well reasoned answer is portrayed and criteria on how to evaluate this statement are presented. An investigation of the relations...

Service Level Agreements are a key issue in Service Oriented Computing. SLA contracts specify client requirements and service guarantees, with emphasis on Quality of Service (cost, performance, availability, etc.). We overview a simple model of contracts for QoS and SLAs that combines two basic programming paradigms: name-passing calculi and concurrent constraint programming. In the resulting c...

Psi-calculi is a formally verified parametric framework for extensions of the pi-calculus, with arbitrary data structures and logical assertions for facts about data. Although this framework in its original form exhibits considerable expressiveness, many applied computational models cannot be directly represented in it. In this paper we extend the applicability of psi-calculi in three ways. Fir...

A linear forwarder is a process which receives one message on a channel and sends it on a different channel. Such a process allows for a simple implementation of the asynchronous pi calculus, by means of a direct encoding of the pi calculus’ input capability (i.e. where a received name is used as the subject of subsequent input). This encoding is fully abstract with respect to barbed congruence...

Process calculi are mathematical tools used for modeling and analyzing the structure and behavior of reactive systems. One such calculus, called APi-calculus (an extension to Pi-calculus), provides support for modeling migration, intelligence, natural grouping and security in agent-based systems [18]. In this article, a visualization tool for the APi-calculus is proposed. Although an invaluable...

The spi calculus is an extension of the pi calculus with cryptographic primitives, designed for the verification of cryptographic protocols. Due to the extension, the naive adaptation of labeled bisimulations for the pi calculus is too strong to be useful for the purpose of verification. Instead, as a viable alternative, several “environment-sensitive” bisimulations have been proposed. In this ...