Presheaf models for the π-calculus

Presheaf models for the π-calculus (1997)

Cached

Download Links

by Ian Stark

Venue:

In Proc. CTCS’97, volume 1290 of LNCS

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Presheaf models for the π-calculus	INFERENCE
AUTHOR NAME	Ian Stark	SVM HeaderParse 0.2
AUTHOR AFFIL	Laboratory for Foundations of Computer Science; School of Informatics, The University of Edinburgh, Scotland	SVM HeaderParse 0.2
ABSTRACT	Abstract. The finite π-calculus has an explicit set-theoretic functor-category model that is known to be fully abstract for strong late bisimulation congruence. We characterize this as the initial free algebra for an appropriate set of operations and equations in the enriched Lawvere theories of Plotkin and Power. Thus we obtain a novel algebraic description for models of the π-calculus, and validate an existing construction as the universal such model. The algebraic operations are intuitive, covering name creation, communication of names over channels, and nondeterminism; the equations then combine these features in a modular fashion. We work in an enriched setting, over a “possible worlds ” category of sets indexed by available names. This expands significantly on the classical notion of algebraic theories, and in particular allows us to use nonstandard arities that vary as processes evolve. Based on our algebraic theory we describe a category of models for the π-calculus, and show that they all preserve bisimulation congruence. We develop a direct construction of free models in this category; and generalise previous results to prove that all free-algebra models are fully abstract. 1	SVM HeaderParse 0.2
YEAR	1997	INFERENCE
VENUE	In Proc. CTCS’97, volume 1290 of LNCS	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	106--126	INFERENCE
CITATIONS	37 found	ParsCit 1.0