

Models for NamePassing Processes: Interleaving and
Causal.
Gian Luca Cattani and Peter Sewell.
Information and Computation, 190(2):136178, May 2004.
[ bib 
doi 
http ]
We study syntaxfree models for namepassing 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 CCSlike 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 namepassing calculi.


Models for NamePassing Processes: Interleaving and
Causal.
Gian Luca Cattani and Peter Sewell.
Technical Report UCAMCLTR505, Computer Laboratory, University of
Cambridge, September 2000.
42pp.
[ bib 
ps 
pdf 
.html ]
We study syntaxfree models for namepassing 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 CCSlike 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 namepassing calculi.


Models for NamePassing Processes: Interleaving and Causal
(Extended Abstract).
Gian Luca Cattani and Peter Sewell.
In LICS 2000.
[ bib 
doi 
ps 
pdf 
http ]
We study syntaxfree models for namepassing 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 CCSlike 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 namepassing calculi.