Thesis description: Name-passing process calculi: operational models and structural operational semantics.

Thesis description: Name-passing process calculi: operational models and structural operational semantics.

Cached

Download Links

[www.cl.cam.ac.uk]

by Sam Staton

Versions

Version 0

Version History

Metadata Version 0

Datum	Value	Source
TITLE	Thesis description: Name-passing process calculi: operational models and structural operational semantics.	SVM HeaderParse 0.2
AUTHOR NAME	Sam Staton	SVM HeaderParse 0.2
AUTHOR AFFIL	; Technical Report UCAM-CL-TR-688. University of Cambridge Computer Laboratory, June 2007.; Summary	SVM HeaderParse 0.2
ABSTRACT	My thesis is about foundations for formal semantics of name-passing process calculi. These calculi are languages for describing systems of agents that communicate channel names along named channels. This facility provides a natural way of describing the mobility of communication links. (The π-calculus of Milner et al. [1992] is a paradigmatic example of such a language.) The thesis is split into two parts, reflecting the two aspects of the foundations of name-passing calculi that are addressed. • Part I of the thesis is dedicated to operational models for name-passing calculi. Conventional operational models, such as labelled transition systems, are inappropriate for name-passing systems. For this reason I develop and relate two different models of name-passing from the literature: indexed labelled transition systems, based on work of Cattani and Sewell [2004], and a coalgebraic approach introduced by Fiore and Turi [2001]. Connections are made with the History Dependent Automata of Montanari and Pistore [2005], and I introduce a new operational model using the nominal logic of Pitts [2003]. • Part II of the thesis concerns structural operational semantics for name-passing calculi. Various work has been done on the meaning of rule-based transition system specifications, and on	SVM HeaderParse 0.2
CITATIONS	15 found	ParsCit 1.0