# topic.models_for_name_passing.bib

@comment{{This file has been generated by bib2bib 1.98}}

@comment{{Command line: /usr/bin/bib2bib -c topic:"models_for_name_passing" -ob topic.models_for_name_passing.bib sewellbib2.bib}}

@inproceedings{CS00,
author = {Gian Luca Cattani and Peter Sewell},
title = {Models for Name-Passing Processes: Interleaving and Causal (Extended Abstract)},
conf = {LICS 2000},
booktitle = {Proceedings of  the 15th IEEE Symposium on Logic in Computer Science (Santa Barbara) },
optcrossref = {},
optkey = {},
opteditor = {},
optvolume = {},
optnumber = {},
optseries = {},
year = {2000},
optorganization = {},
optpublisher = {},
optaddress = {},
month = jun,
pages = {322--333},
note = {},
optannote = {},
url = {https://doi.org/10.1109/LICS.2000.855781},
doi = {10.1109/LICS.2000.855781},
pdf = {http://www.cl.cam.ac.uk/users/pes20/indexing.pdf},
ps = {http://www.cl.cam.ac.uk/users/pes20/indexing.ps},
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.
},
topic = {models_for_name_passing}
}

@techreport{CS00b,
author = {Gian Luca Cattani and Peter Sewell},
title = {Models for Name-Passing Processes: Interleaving and Causal},
institution = {Computer Laboratory, University of Cambridge},
year = {2000},
optkey = {},
opttype = {},
number = {UCAM-CL-TR-505},
optaddress = {},
month = sep,
note = {42pp. },
optannote = {},
pdf = {http://www.cl.cam.ac.uk/~pes20/indexing-tr.pdf},
ps = {http://www.cl.cam.ac.uk/~pes20/indexing-tr.ps},
url = {http://www.cl.cam.ac.uk/TechReports/UCAM-CL-TR-505.html},
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 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.},
topic = {models_for_name_passing}
}

@article{CS00c,
author = {Gian Luca Cattani and Peter Sewell},
title = {Models for Name-Passing Processes: Interleaving and Causal},
journal = {Information and Computation},
year = {2004},
optkey = {},
volume = {190},
number = {2},
pages = {136--178},
month = may,
optnote = {},
optannote = {},
url = {https://doi.org/10.1016/j.ic.2003.12.003},
doi = {10.1016/j.ic.2003.12.003},
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 π-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. 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.},
topic = {models_for_name_passing}
}