Observing Reductions in Nominal Calculi Via a Graphical Encoding of Processes

The paper introduces a novel approach to the synthesis of labelled transition systems for calculi with name mobility. The proposal is based on a graphical encoding: Each process is mapped into a (ranked) uch that the denotation is fully abstract with respect to the usual structural congruence (i.e., two processes are equivalent exactly when the corresponding encodings yield the same graph). Ranked graphs are naturally equipped with a few algebraic operations, and they are proved to form a suitable (bi)category of cospans. Then, as proved by Sassone and Sobocinski, the synthesis mechanism based on relative pushout, originally proposed by Milner and Leifer, can be applied. The resulting labelled transition system has ranked graphs as both states and labels, and it induces on (encodings of) processes an observational equivalence that is reminiscent of early bisimilarity.

• Type: Conference
• Year: 2005
• Where: BIRTHDAY
• Authors: Fabio Gadducci, Ugo Montanari
• Keywords: Applied Computing, BIRTHDAY 2005, Corresponding Encodings, Labelled Transition System, Usual Structural Congruence