Models for Name-Passing Processes: Interleaving and Causal

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 π-calculus operations, defining Indexed Labelled Transition Systems. For noninterleaving 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. We establish completeness properties of, and adjunctions between, categories of the two models. Alternative indexing structures and possible applications are also discussed. These are first steps towards a uniform understanding of the semantics and operations of name-passing calculi. Contents

• Type: Conference
• Year: 2000
• Where: LICS
• Authors: Gian Luca Cattani, Peter Sewell
• Keywords: Asynchronous Transition Systems, Automated Reasoning, Labelled Transition, Labelled Transition Systems, LICS 2000