Department of Computer Science and Technology

Technical reports

Models for name-passing processes: interleaving and causal

Gian Luca Cattani, Peter Sewell

September 2000, 42 pages

DOI: 10.48456/tr-505


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.

Full text

PDF (0.5 MB)
PS (0.2 MB)
DVI (0.1 MB)

BibTeX record

  author =	 {Cattani, Gian Luca and Sewell, Peter},
  title = 	 {{Models for name-passing processes: interleaving and causal}},
  year = 	 2000,
  month = 	 sep,
  url = 	 {},
  institution =  {University of Cambridge, Computer Laboratory},
  doi = 	 {10.48456/tr-505},
  number = 	 {UCAM-CL-TR-505}