We have developed a calculus, called Ipi, for describing the aberrance in biological models. Our approach extends the traditional pi calculus to handle aberrant process in the signal transduction. In this paper we propose a typing system that replaces the tag system of Ipi calculus. It is shown that the typing system is equal to the tag system in terms of the expressive power.

There is great interest in applying nominal calculi—computational formalisms that include dynamic name generation—to the problems of programming, specifying, and verifying secure and mobile computations. These notes introduce three nominal calculi—the pi calculus, the spi calculus, and the ambient calculus. We describe some typical techniques, and survey related work.

This paper presents an abstract machine for the stochastic bioambient calculus. The abstract machine is proved sound and complete with respect to a novel stochastic semantics, and is also shown to preserve the reduction probabilities of the calculus. The machine is implemented as an extension to an existing simulator for stochastic pi-calculus.

Design of security protocols is notoriously error-prone. For this reason, it is required to use formal methods to analyze their security properties. In the paper we present a formal analysis of the Canvas protocol. The Canvas protocol was developed by Harald Vogt and should provide data integrity in Wireless Sensor Networks. However, Dieter Gollmann published an attack on the protocol. We consi...

Social sign-on and social sharing are becoming an ever more popular feature of web applications. This success is largely due to the APIs and support offered by prominent social networks, such as Facebook, Twitter and Google, on the basis of new open standards such as the OAuth 2.0 authorization protocol. A formal analysis of these protocols must account for malicious websites and common web app...

Formal models of communicating and concurrent systems are one of the most important topics in formal methods, and process calculus is one of the most successful formal models of communicating and concurrent systems. In the previous works, the author systematically studied topology in process calculus, probabilistic process calculus and pi-calculus with noisy channels in order to describe approx...

We present an approach to modeling computational calculi using higher category theory. Specifically we present a fully abstract semantics for the π-calculus. The interpretation is consistent with Curry-Howard, interpreting terms as typed morphisms, while simultaneously providing an explicit interpretation of the rewrite rules of standard operational presentations as 2-morphisms. One of the key ...

The Sπ-calculus is a synchronous π-calculus which is based on the SL model. The latter is a relaxation of the Esterel model where the reaction to the absence of a signal within an instant can only happen at the next instant. In the present work, we present and characterise a compositional semantics of the Sπ-calculus based on suitable notions of labelled transition system and bisimulation. Base...

In a concurrent setting, causally-consistent reversibility relates causality and reversibility. In this note we overview three causal semantics for π-calculus: two classical and a recent one used for a reversible variant of π-calculus. We show the differences between them via examples, and discuss how to revise the classical one in order to be used as the underlying machinery for a reversible c...