Translating Pi-Calculus into LOTOS NT

Abstract

Process calculi supporting mobile communication, such as the π-calculus, are often seen as an evolution of classical value-passing calculi, in which communication between processes takes place along a fixed network of static channels. In this paper, we attempt to bring these calculi closer by proposing a translation from the finite control fragment of the π-calculus to Lotos NT, a value-passing concurrent language with classical process algebra flavour. Our translation is succinct in the size of the π-calculus specification and preserves the semantics of the language by ensuring a one-to-one correspondence between the states and transitions of the labeled transition systems corresponding to the input π-calculus and the output Lotos NT specifications. We automated this translation by means of the Pic2Lnt tool, which makes it possible to analyze π-calculus specifications using all the state-of-the-art simulation and verification functionalities provided by the Cadp toolbox.

Partial Model Checking using Networks of Labelled Transition Systems and Boole an Equation Systems

“…For the latter two, this is done via an automated generation of intermediate Lotos code using translators [35,12]. Other languages can easily be connected to Cadp using either the same approach (for instance a connection of the applied π-calculus [44]), or through the Open/Caesar [19] Api of Cadp. • Process compositions can be described in the Exp.Open 2.0 language [31], which provides various parallel composition operators, such as synchronisation vectors [6], process algebra operators (Lotos, Ccs, Csp, µCrl), and the generalised parallel composition operator of E-Lotos/Lotos NT [24].…”

“…Regarding the communication of data values, our approach is applicable to classical (i.e., with static communication) value-passing process algebras equipped with early operational semantics. This framework encompasses a significant fragment of the π-calculus (containing channel mobility and bounded process creation), which can be translated into classical value-passing process algebras [44].…”

PIC2LNT: Model Transformation for Model Checking an Applied Pi-Calculus

“…Communication on a πcalculus channel is translated in Lnt as a choice on all Lnt channels connecting the current agent to its environment. The translation of the original π-calculus to Lnt is detailed in [9].…”

“…Our objective is to provide analysis features for π-calculus specifications by reusing the verification technology already available for value-passing process algebras without mobility. Contrary to existing verification tools for the π-calculus, which rely on specific algorithms and intermediate models, such as Hd-automata [5], our approach is based on a novel translation [9] from the finite control fragment of π-calculus to a standard process algebra called Lotos Nt (Lnt for short) [3]. Lnt is a value-passing process algebra with imperative programming flavour accepted as input by the Cadp verification toolbox [8].…”

“…As language for describing data types and functions, a natural choice was Lnt itself: in this way, the data types and functions used in the π-calculus specification can be directly imported into the Lnt code produced by translation. We generalized our previous translation [9] to handle applied π-calculus specifications, and we automated it in the tool Pic2Lnt 2.0. This enables the analysis of applied π-calculus specifications using all verification tools of Cadp, in particular the Evaluator 4.0 on-the-fly model checker [11], which evaluates temporal properties involving channel names and data values.…”