Models for Name-Passing Processes: Interleaving and Causal (Extended Abstract)

Gian Luca Cattani and Peter Sewell

In Proceedings of the Fifteenth Annual IEEE Symposium on Logic in Computer Science, LICS 2000, pages 322--333, IEEE Computer Society Press, 2000.

Available as gzipped postscript (125k), pdf (251k) and dvi (102k)

Abstract

We study syntax-free models for name-passing processes. For interleaving semantics, we identify the indexing structure required of an early labelled transition system to support the usual pi-calculus operations, defining Indexed Labelled Transition Systems. For non-interleaving causal semantics we define Indexed Labelled Asynchronous Transition Systems, smoothly generalizing both our interleaving model and the standard Asynchronous Transition Systems model for CCS-like calculi. In each case we relate a denotational semantics to an operational view, for bisimulation and causal bisimulation respectively. This is a first step towards a uniform understanding of the semantics and operations of name-passing calculi.

@InProceedings{cattani/sewell:modnppic,
author=       {Cattani, Gian Luca and Sewell, Peter},
title=        {Models for Name-Passing Processes: Interleaving and
Causal (Extended Abstract)}, 
booktitle =   {Proceedings of the Fifteenth Annual IEEE Symposium on Logic 
               in Computer Science, LICS 2000},  
year =        2000,
organization= {IEEE Computer Society Press},
pages=         {322-333}
}